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-167838856100580.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-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856100580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 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.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 1.5M 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-20b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678577213132

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-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 23:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 23:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:26:55] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2023-03-11 23:26:55] [INFO ] Transformed 5372 places.
[2023-03-11 23:26:55] [INFO ] Transformed 6193 transitions.
[2023-03-11 23:26:55] [INFO ] Found NUPN structural information;
[2023-03-11 23:26:55] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2261 places :
Symmetric choice reduction at 0 with 2261 rule applications. Total rules 2261 place count 3111 transition count 3932
Iterating global reduction 0 with 2261 rules applied. Total rules applied 4522 place count 3111 transition count 3932
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 5599 place count 2034 transition count 2855
Iterating global reduction 0 with 1077 rules applied. Total rules applied 6676 place count 2034 transition count 2855
Discarding 702 places :
Symmetric choice reduction at 0 with 702 rule applications. Total rules 7378 place count 1332 transition count 2153
Iterating global reduction 0 with 702 rules applied. Total rules applied 8080 place count 1332 transition count 2153
Ensure Unique test removed 342 transitions
Reduce isomorphic transitions removed 342 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 8422 place count 1332 transition count 1811
Applied a total of 8422 rules in 1646 ms. Remains 1332 /5372 variables (removed 4040) and now considering 1811/6193 (removed 4382) transitions.
// Phase 1: matrix 1811 rows 1332 cols
[2023-03-11 23:26:57] [INFO ] Computed 22 place invariants in 73 ms
[2023-03-11 23:26:57] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-11 23:26:57] [INFO ] Invariant cache hit.
[2023-03-11 23:26:59] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2023-03-11 23:26:59] [INFO ] Invariant cache hit.
[2023-03-11 23:26:59] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1332/5372 places, 1811/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4457 ms. Remains : 1332/5372 places, 1811/6193 transitions.
Support contains 47 out of 1332 places after structural reductions.
[2023-03-11 23:27:00] [INFO ] Flatten gal took : 176 ms
[2023-03-11 23:27:00] [INFO ] Flatten gal took : 92 ms
[2023-03-11 23:27:00] [INFO ] Input system was already deterministic with 1811 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) 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 28) 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 28) seen :0
Running SMT prover for 28 properties.
[2023-03-11 23:27:01] [INFO ] Invariant cache hit.
[2023-03-11 23:27:02] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-11 23:27:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-11 23:27:05] [INFO ] After 2430ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2023-03-11 23:27:08] [INFO ] Deduced a trap composed of 412 places in 375 ms of which 5 ms to minimize.
[2023-03-11 23:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-11 23:27:08] [INFO ] After 5714ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :26
Attempting to minimize the solution found.
Minimization took 1804 ms.
[2023-03-11 23:27:10] [INFO ] After 8730ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :26
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 23 properties in 213 ms.
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1265 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 5 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1231 transition count 1587
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1129 transition count 1587
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 205 place count 1129 transition count 1540
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 299 place count 1082 transition count 1540
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1024 transition count 1482
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1024 transition count 1482
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 421 place count 1024 transition count 1476
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 432 place count 1013 transition count 1465
Iterating global reduction 3 with 11 rules applied. Total rules applied 443 place count 1013 transition count 1465
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 454 place count 1013 transition count 1454
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 702 place count 889 transition count 1330
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 742 place count 889 transition count 1290
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 763 place count 868 transition count 1269
Iterating global reduction 5 with 21 rules applied. Total rules applied 784 place count 868 transition count 1269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 785 place count 868 transition count 1268
Free-agglomeration rule applied 760 times.
Iterating global reduction 6 with 760 rules applied. Total rules applied 1545 place count 868 transition count 508
Reduce places removed 760 places and 0 transitions.
Drop transitions removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Iterating post reduction 6 with 1101 rules applied. Total rules applied 2646 place count 108 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2647 place count 107 transition count 166
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 106 vertex of which 40 / 106 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2649 place count 86 transition count 166
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 2689 place count 86 transition count 126
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 2689 place count 86 transition count 106
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 2729 place count 66 transition count 106
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 2749 place count 66 transition count 86
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 2789 place count 46 transition count 66
Free-agglomeration rule applied 20 times.
Iterating global reduction 10 with 20 rules applied. Total rules applied 2809 place count 46 transition count 46
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 75 rules applied. Total rules applied 2884 place count 8 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2885 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2886 place count 7 transition count 8
Applied a total of 2886 rules in 846 ms. Remains 7 /1332 variables (removed 1325) and now considering 8/1811 (removed 1803) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 7/1332 places, 8/1811 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Computed a total of 23 stabilizing places and 23 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((X(F(p0))&&F(p1))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 1311 transition count 1784
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1299 transition count 1772
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 1299 transition count 1772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 1299 transition count 1766
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 1293 transition count 1760
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 1293 transition count 1760
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 1293 transition count 1754
Applied a total of 96 rules in 164 ms. Remains 1293 /1332 variables (removed 39) and now considering 1754/1811 (removed 57) transitions.
// Phase 1: matrix 1754 rows 1293 cols
[2023-03-11 23:27:12] [INFO ] Computed 22 place invariants in 40 ms
[2023-03-11 23:27:13] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-11 23:27:13] [INFO ] Invariant cache hit.
[2023-03-11 23:27:14] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2023-03-11 23:27:14] [INFO ] Invariant cache hit.
[2023-03-11 23:27:15] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1293/1332 places, 1754/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2868 ms. Remains : 1293/1332 places, 1754/1811 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-00 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=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s378 1) (EQ s392 1) (EQ s1074 1)), p0:(EQ s1238 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 6 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-00 finished in 3181 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(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 1299 transition count 1771
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 1299 transition count 1771
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 1299 transition count 1766
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 1292 transition count 1759
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 1292 transition count 1759
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 152 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-11 23:27:15] [INFO ] Computed 22 place invariants in 41 ms
[2023-03-11 23:27:16] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-11 23:27:16] [INFO ] Invariant cache hit.
[2023-03-11 23:27:17] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2023-03-11 23:27:17] [INFO ] Invariant cache hit.
[2023-03-11 23:27:18] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2830 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s222 1), p0:(EQ s461 1), p2:(EQ s222 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 732 reset in 358 ms.
Product exploration explored 100000 steps with 734 reset in 355 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 609 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 23:27:20] [INFO ] Invariant cache hit.
[2023-03-11 23:27:21] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-11 23:27:22] [INFO ] After 728ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4 real:5
[2023-03-11 23:27:22] [INFO ] After 1088ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :3 real:6
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-11 23:27:22] [INFO ] After 1763ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :3 real:6
[2023-03-11 23:27:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2023-03-11 23:27:23] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-11 23:27:24] [INFO ] After 1589ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-11 23:27:25] [INFO ] After 2418ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 5 properties in 21 ms.
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Graph (trivial) has 1227 edges and 1292 vertex of which 121 / 1292 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 1191 transition count 1532
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 1092 transition count 1532
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 199 place count 1092 transition count 1491
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 281 place count 1051 transition count 1491
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 320 place count 1012 transition count 1452
Iterating global reduction 2 with 39 rules applied. Total rules applied 359 place count 1012 transition count 1452
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 605 place count 889 transition count 1329
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 645 place count 889 transition count 1289
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 665 place count 869 transition count 1269
Iterating global reduction 3 with 20 rules applied. Total rules applied 685 place count 869 transition count 1269
Free-agglomeration rule applied 763 times.
Iterating global reduction 3 with 763 rules applied. Total rules applied 1448 place count 869 transition count 506
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 288 edges and 106 vertex of which 21 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1125 rules applied. Total rules applied 2573 place count 21 transition count 145
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 4 with 119 rules applied. Total rules applied 2692 place count 21 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2693 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2694 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 14 / 18 are part of one of the 4 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 2699 place count 8 transition count 23
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 22 rules applied. Total rules applied 2721 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2722 place count 4 transition count 4
Applied a total of 2722 rules in 282 ms. Remains 4 /1292 variables (removed 1288) and now considering 4/1753 (removed 1749) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 4/1292 places, 4/1753 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 14 factoid took 1131 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 32 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2023-03-11 23:27:27] [INFO ] Invariant cache hit.
[2023-03-11 23:27:27] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-11 23:27:27] [INFO ] Invariant cache hit.
[2023-03-11 23:27:28] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2023-03-11 23:27:28] [INFO ] Invariant cache hit.
[2023-03-11 23:27:29] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2435 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 907 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 23:27:31] [INFO ] Invariant cache hit.
[2023-03-11 23:27:31] [INFO ] [Real]Absence check using 22 positive place invariants in 18 ms returned sat
[2023-03-11 23:27:32] [INFO ] After 591ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:3
[2023-03-11 23:27:32] [INFO ] After 770ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-11 23:27:32] [INFO ] After 1186ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:3
[2023-03-11 23:27:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-11 23:27:33] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 23:27:34] [INFO ] After 1184ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-11 23:27:34] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 5 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p2) (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (AND p2 p0)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT p2))]
Knowledge based reduction with 18 factoid took 1222 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 301 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 265 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 733 reset in 275 ms.
Product exploration explored 100000 steps with 735 reset in 283 ms.
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 37 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2023-03-11 23:27:37] [INFO ] Invariant cache hit.
[2023-03-11 23:27:37] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-11 23:27:37] [INFO ] Invariant cache hit.
[2023-03-11 23:27:38] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
[2023-03-11 23:27:38] [INFO ] Invariant cache hit.
[2023-03-11 23:27:39] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2532 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-01 finished in 24351 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)&&F(p1)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1230 transition count 1605
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1023 transition count 1501
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1023 transition count 1501
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 422 place count 1023 transition count 1494
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 422 place count 1023 transition count 1493
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 1022 transition count 1493
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 434 place count 1012 transition count 1483
Iterating global reduction 3 with 10 rules applied. Total rules applied 444 place count 1012 transition count 1483
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 454 place count 1012 transition count 1473
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 696 place count 891 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 697 place count 890 transition count 1351
Iterating global reduction 4 with 1 rules applied. Total rules applied 698 place count 890 transition count 1351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 699 place count 890 transition count 1350
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 718 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 720 place count 888 transition count 1329
Applied a total of 720 rules in 575 ms. Remains 888 /1332 variables (removed 444) and now considering 1329/1811 (removed 482) transitions.
[2023-03-11 23:27:40] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2023-03-11 23:27:40] [INFO ] Computed 22 place invariants in 30 ms
[2023-03-11 23:27:40] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-11 23:27:40] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-11 23:27:40] [INFO ] Invariant cache hit.
[2023-03-11 23:27:41] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-11 23:27:41] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-11 23:27:41] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2023-03-11 23:27:41] [INFO ] Invariant cache hit.
[2023-03-11 23:27:42] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1332 places, 1329/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2565 ms. Remains : 888/1332 places, 1329/1811 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s630 1), p0:(EQ s311 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-02 finished in 2707 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(p1)||p0)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 1300 transition count 1767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1294 transition count 1761
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1294 transition count 1761
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 1294 transition count 1756
Applied a total of 93 rules in 140 ms. Remains 1294 /1332 variables (removed 38) and now considering 1756/1811 (removed 55) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-11 23:27:42] [INFO ] Computed 22 place invariants in 39 ms
[2023-03-11 23:27:43] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-11 23:27:43] [INFO ] Invariant cache hit.
[2023-03-11 23:27:44] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2023-03-11 23:27:44] [INFO ] Invariant cache hit.
[2023-03-11 23:27:45] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1332 places, 1756/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2611 ms. Remains : 1294/1332 places, 1756/1811 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1270 0), p0:(OR (EQ s835 0) (EQ s1270 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]]
Product exploration explored 100000 steps with 50000 reset in 829 ms.
Product exploration explored 100000 steps with 50000 reset in 875 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-03 finished in 4599 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))||F((p1||G(p2))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 1300 transition count 1767
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 1294 transition count 1761
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 1294 transition count 1761
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 1294 transition count 1756
Applied a total of 93 rules in 140 ms. Remains 1294 /1332 variables (removed 38) and now considering 1756/1811 (removed 55) transitions.
// Phase 1: matrix 1756 rows 1294 cols
[2023-03-11 23:27:47] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 23:27:47] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-11 23:27:47] [INFO ] Invariant cache hit.
[2023-03-11 23:27:48] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2023-03-11 23:27:48] [INFO ] Invariant cache hit.
[2023-03-11 23:27:49] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1294/1332 places, 1756/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2551 ms. Remains : 1294/1332 places, 1756/1811 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s745 0), p0:(EQ s837 0), p2:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 815 ms.
Product exploration explored 100000 steps with 50000 reset in 833 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/1294 stabilizing places and 22/1756 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-04 finished in 4477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1265 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1230 transition count 1605
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1023 transition count 1501
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1023 transition count 1501
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 421 place count 1023 transition count 1495
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 1023 transition count 1494
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 423 place count 1022 transition count 1494
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 434 place count 1011 transition count 1483
Iterating global reduction 3 with 11 rules applied. Total rules applied 445 place count 1011 transition count 1483
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 456 place count 1011 transition count 1472
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 698 place count 890 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 699 place count 889 transition count 1350
Iterating global reduction 4 with 1 rules applied. Total rules applied 700 place count 889 transition count 1350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 701 place count 889 transition count 1349
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 721 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 723 place count 887 transition count 1327
Applied a total of 723 rules in 443 ms. Remains 887 /1332 variables (removed 445) and now considering 1327/1811 (removed 484) transitions.
[2023-03-11 23:27:52] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2023-03-11 23:27:52] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-11 23:27:52] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-11 23:27:52] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:27:52] [INFO ] Invariant cache hit.
[2023-03-11 23:27:53] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2023-03-11 23:27:53] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-11 23:27:53] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:27:53] [INFO ] Invariant cache hit.
[2023-03-11 23:27:54] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 887/1332 places, 1327/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2503 ms. Remains : 887/1332 places, 1327/1811 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s21 1), p1:(OR (NEQ s89 1) (NEQ s287 1) (NEQ s587 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 472 steps with 16 reset in 13 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-05 finished in 2642 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)) U (X((p1 U p2))||G(p0))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 151 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-11 23:27:54] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-11 23:27:54] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-11 23:27:54] [INFO ] Invariant cache hit.
[2023-03-11 23:27:56] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2023-03-11 23:27:56] [INFO ] Invariant cache hit.
[2023-03-11 23:27:56] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2591 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s423 1), p1:(EQ s195 1), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-06 finished in 2831 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((X(p1) U (p2&&X(p1))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1311 transition count 1790
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1311 transition count 1790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 1311 transition count 1783
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 1300 transition count 1772
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 1300 transition count 1772
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 1300 transition count 1766
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 1295 transition count 1761
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 1295 transition count 1761
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 91 place count 1295 transition count 1757
Applied a total of 91 rules in 145 ms. Remains 1295 /1332 variables (removed 37) and now considering 1757/1811 (removed 54) transitions.
// Phase 1: matrix 1757 rows 1295 cols
[2023-03-11 23:27:57] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-11 23:27:57] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-11 23:27:57] [INFO ] Invariant cache hit.
[2023-03-11 23:27:58] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2023-03-11 23:27:58] [INFO ] Invariant cache hit.
[2023-03-11 23:27:59] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1295/1332 places, 1757/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2535 ms. Remains : 1295/1332 places, 1757/1811 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s204 1) (EQ s658 0)), p2:(EQ s787 1), p1:(EQ s658 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]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-07 finished in 2821 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(p0)&&F(p1)))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 1310 transition count 1783
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 1297 transition count 1770
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 1297 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 1297 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 1290 transition count 1757
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 1290 transition count 1757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 1290 transition count 1751
Applied a total of 102 rules in 145 ms. Remains 1290 /1332 variables (removed 42) and now considering 1751/1811 (removed 60) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2023-03-11 23:28:00] [INFO ] Computed 22 place invariants in 36 ms
[2023-03-11 23:28:00] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 23:28:00] [INFO ] Invariant cache hit.
[2023-03-11 23:28:01] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2023-03-11 23:28:01] [INFO ] Invariant cache hit.
[2023-03-11 23:28:02] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1751/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2635 ms. Remains : 1290/1332 places, 1751/1811 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s108 1) (EQ s206 1) (EQ s996 1)), p0:(OR (EQ s108 0) (EQ s206 0) (EQ s996 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-08 finished in 2785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 1292 transition count 1753
Applied a total of 98 rules in 139 ms. Remains 1292 /1332 variables (removed 40) and now considering 1753/1811 (removed 58) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2023-03-11 23:28:02] [INFO ] Computed 22 place invariants in 34 ms
[2023-03-11 23:28:03] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-11 23:28:03] [INFO ] Invariant cache hit.
[2023-03-11 23:28:04] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2023-03-11 23:28:04] [INFO ] Invariant cache hit.
[2023-03-11 23:28:05] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1292/1332 places, 1753/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2655 ms. Remains : 1292/1332 places, 1753/1811 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s655 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-09 finished in 2747 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(X(G((p1&&X(X(p2))))))&&p0)))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 1298 transition count 1770
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 1298 transition count 1770
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 1298 transition count 1765
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 1291 transition count 1758
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 1291 transition count 1758
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 1291 transition count 1752
Applied a total of 100 rules in 139 ms. Remains 1291 /1332 variables (removed 41) and now considering 1752/1811 (removed 59) transitions.
// Phase 1: matrix 1752 rows 1291 cols
[2023-03-11 23:28:05] [INFO ] Computed 22 place invariants in 40 ms
[2023-03-11 23:28:06] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-11 23:28:06] [INFO ] Invariant cache hit.
[2023-03-11 23:28:07] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2023-03-11 23:28:07] [INFO ] Invariant cache hit.
[2023-03-11 23:28:08] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1291/1332 places, 1752/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2623 ms. Remains : 1291/1332 places, 1752/1811 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-10 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: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 5}]], initial=3, aps=[p0:(AND (EQ s249 1) (EQ s873 1)), p1:(EQ s151 1), p2:(EQ s873 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-10 finished in 2908 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 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 115 / 1332 are part of one of the 19 SCC in 2 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 1235 transition count 1609
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 209 place count 1131 transition count 1609
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 209 place count 1131 transition count 1562
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 303 place count 1084 transition count 1562
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 361 place count 1026 transition count 1504
Iterating global reduction 2 with 58 rules applied. Total rules applied 419 place count 1026 transition count 1504
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 426 place count 1026 transition count 1497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 426 place count 1026 transition count 1496
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 1025 transition count 1496
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 439 place count 1014 transition count 1485
Iterating global reduction 3 with 11 rules applied. Total rules applied 450 place count 1014 transition count 1485
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 461 place count 1014 transition count 1474
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 709 place count 890 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 710 place count 889 transition count 1349
Iterating global reduction 4 with 1 rules applied. Total rules applied 711 place count 889 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 712 place count 889 transition count 1348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 714 place count 888 transition count 1348
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 735 place count 888 transition count 1327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 737 place count 886 transition count 1325
Applied a total of 737 rules in 443 ms. Remains 886 /1332 variables (removed 446) and now considering 1325/1811 (removed 486) transitions.
[2023-03-11 23:28:08] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2023-03-11 23:28:08] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 23:28:09] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-11 23:28:09] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
[2023-03-11 23:28:09] [INFO ] Invariant cache hit.
[2023-03-11 23:28:10] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
[2023-03-11 23:28:10] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 23:28:10] [INFO ] Flow matrix only has 1287 transitions (discarded 38 similar events)
[2023-03-11 23:28:10] [INFO ] Invariant cache hit.
[2023-03-11 23:28:10] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1332 places, 1325/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2379 ms. Remains : 886/1332 places, 1325/1811 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11 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 s261 0)], 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 149 steps with 5 reset in 9 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 2479 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(p0)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1309 transition count 1788
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1309 transition count 1788
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 1309 transition count 1781
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 1296 transition count 1768
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 1296 transition count 1768
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 85 place count 1296 transition count 1762
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 1289 transition count 1755
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 1289 transition count 1755
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 1289 transition count 1749
Applied a total of 105 rules in 140 ms. Remains 1289 /1332 variables (removed 43) and now considering 1749/1811 (removed 62) transitions.
// Phase 1: matrix 1749 rows 1289 cols
[2023-03-11 23:28:11] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 23:28:11] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-11 23:28:11] [INFO ] Invariant cache hit.
[2023-03-11 23:28:12] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
[2023-03-11 23:28:12] [INFO ] Invariant cache hit.
[2023-03-11 23:28:13] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1289/1332 places, 1749/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2587 ms. Remains : 1289/1332 places, 1749/1811 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s556 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 300 steps with 2 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-12 finished in 2677 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(F(!p0))||(F(!p0)&&F(G(!p1)))))))'
Support contains 5 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 1310 transition count 1783
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 1297 transition count 1770
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 1297 transition count 1770
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 1297 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 1290 transition count 1757
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 1290 transition count 1757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 1290 transition count 1751
Applied a total of 102 rules in 154 ms. Remains 1290 /1332 variables (removed 42) and now considering 1751/1811 (removed 60) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2023-03-11 23:28:13] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 23:28:14] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-11 23:28:14] [INFO ] Invariant cache hit.
[2023-03-11 23:28:15] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2023-03-11 23:28:15] [INFO ] Invariant cache hit.
[2023-03-11 23:28:16] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1751/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 1290/1332 places, 1751/1811 transitions.
Stuttering acceptance computed with spot in 225 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s783 1) (EQ s851 1) (EQ s1263 1)), p1:(AND (EQ s466 1) (EQ s1284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 275 ms.
Product exploration explored 100000 steps with 733 reset in 285 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 23:28:17] [INFO ] Invariant cache hit.
[2023-03-11 23:28:17] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2023-03-11 23:28:17] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p0)))
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-13 finished in 4038 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((X(p0)||F(p1))))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1310 transition count 1789
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1310 transition count 1789
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 1310 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 1297 transition count 1769
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 1297 transition count 1769
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 1297 transition count 1763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 1290 transition count 1756
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 1290 transition count 1756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 1290 transition count 1750
Applied a total of 103 rules in 140 ms. Remains 1290 /1332 variables (removed 42) and now considering 1750/1811 (removed 61) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2023-03-11 23:28:17] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 23:28:18] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-11 23:28:18] [INFO ] Invariant cache hit.
[2023-03-11 23:28:19] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-11 23:28:19] [INFO ] Invariant cache hit.
[2023-03-11 23:28:20] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1290/1332 places, 1750/1811 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2607 ms. Remains : 1290/1332 places, 1750/1811 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s723 0), p0:(EQ s60 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 274 ms.
Product exploration explored 100000 steps with 738 reset in 299 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 259818 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259818 steps, saw 104043 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 23:28:24] [INFO ] Invariant cache hit.
[2023-03-11 23:28:24] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 23:28:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2023-03-11 23:28:25] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 23:28:25] [INFO ] Deduced a trap composed of 163 places in 109 ms of which 1 ms to minimize.
[2023-03-11 23:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-11 23:28:25] [INFO ] After 893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-11 23:28:25] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 245 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 34 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
[2023-03-11 23:28:26] [INFO ] Invariant cache hit.
[2023-03-11 23:28:27] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 23:28:27] [INFO ] Invariant cache hit.
[2023-03-11 23:28:28] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2023-03-11 23:28:28] [INFO ] Invariant cache hit.
[2023-03-11 23:28:29] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2538 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 248560 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248560 steps, saw 101460 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 23:28:32] [INFO ] Invariant cache hit.
[2023-03-11 23:28:32] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 23:28:32] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-11 23:28:33] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 23:28:33] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 0 ms to minimize.
[2023-03-11 23:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-11 23:28:33] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-11 23:28:33] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1189 transition count 1530
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 1091 transition count 1529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 1090 transition count 1529
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 199 place count 1090 transition count 1488
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 281 place count 1049 transition count 1488
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 319 place count 1011 transition count 1450
Iterating global reduction 3 with 38 rules applied. Total rules applied 357 place count 1011 transition count 1450
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 603 place count 888 transition count 1327
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 642 place count 888 transition count 1288
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 662 place count 868 transition count 1268
Iterating global reduction 4 with 20 rules applied. Total rules applied 682 place count 868 transition count 1268
Free-agglomeration rule applied 763 times.
Iterating global reduction 4 with 763 rules applied. Total rules applied 1445 place count 868 transition count 505
Reduce places removed 763 places and 0 transitions.
Drop transitions removed 361 transitions
Reduce isomorphic transitions removed 361 transitions.
Graph (complete) has 285 edges and 105 vertex of which 15 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1125 rules applied. Total rules applied 2570 place count 15 transition count 144
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 5 with 126 rules applied. Total rules applied 2696 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2697 place count 14 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 12 vertex of which 10 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 2700 place count 4 transition count 17
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 2713 place count 4 transition count 4
Applied a total of 2713 rules in 242 ms. Remains 4 /1290 variables (removed 1286) and now considering 4/1750 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 4/1290 places, 4/1750 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 732 reset in 267 ms.
Product exploration explored 100000 steps with 735 reset in 280 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 1189 transition count 1648
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 81 place count 1189 transition count 1648
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 139 place count 1189 transition count 1648
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 235 place count 1093 transition count 1552
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 331 place count 1093 transition count 1552
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 185 places in 1 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 436 place count 1093 transition count 1591
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 480 place count 1049 transition count 1547
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 524 place count 1049 transition count 1547
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 544 place count 1049 transition count 1587
Deduced a syphon composed of 161 places in 0 ms
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 1 with 39 rules applied. Total rules applied 583 place count 1049 transition count 1548
Deduced a syphon composed of 161 places in 0 ms
Applied a total of 583 rules in 708 ms. Remains 1049 /1290 variables (removed 241) and now considering 1548/1750 (removed 202) transitions.
[2023-03-11 23:28:36] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 23:28:36] [INFO ] Flow matrix only has 1509 transitions (discarded 39 similar events)
// Phase 1: matrix 1509 rows 1049 cols
[2023-03-11 23:28:36] [INFO ] Computed 22 place invariants in 32 ms
[2023-03-11 23:28:37] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/1290 places, 1548/1750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1468 ms. Remains : 1049/1290 places, 1548/1750 transitions.
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 35 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2023-03-11 23:28:37] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-11 23:28:37] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-11 23:28:37] [INFO ] Invariant cache hit.
[2023-03-11 23:28:39] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2023-03-11 23:28:39] [INFO ] Invariant cache hit.
[2023-03-11 23:28:39] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2544 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 22308 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)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1268 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 0 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1230 transition count 1606
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1128 transition count 1606
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 205 place count 1128 transition count 1559
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 358 place count 1022 transition count 1500
Iterating global reduction 2 with 59 rules applied. Total rules applied 417 place count 1022 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 424 place count 1022 transition count 1493
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 435 place count 1011 transition count 1482
Iterating global reduction 3 with 11 rules applied. Total rules applied 446 place count 1011 transition count 1482
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 457 place count 1011 transition count 1471
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 701 place count 889 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 702 place count 888 transition count 1348
Iterating global reduction 4 with 1 rules applied. Total rules applied 703 place count 888 transition count 1348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 704 place count 888 transition count 1347
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 724 place count 888 transition count 1327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 726 place count 886 transition count 1325
Applied a total of 726 rules in 438 ms. Remains 886 /1332 variables (removed 446) and now considering 1325/1811 (removed 486) transitions.
[2023-03-11 23:28:40] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
// Phase 1: matrix 1286 rows 886 cols
[2023-03-11 23:28:40] [INFO ] Computed 22 place invariants in 43 ms
[2023-03-11 23:28:40] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 23:28:40] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
[2023-03-11 23:28:40] [INFO ] Invariant cache hit.
[2023-03-11 23:28:41] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2023-03-11 23:28:41] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-11 23:28:41] [INFO ] Flow matrix only has 1286 transitions (discarded 39 similar events)
[2023-03-11 23:28:41] [INFO ] Invariant cache hit.
[2023-03-11 23:28:42] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 886/1332 places, 1325/1811 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2390 ms. Remains : 886/1332 places, 1325/1811 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-15 finished in 2439 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(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-14
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1332/1332 places, 1811/1811 transitions.
Graph (trivial) has 1267 edges and 1332 vertex of which 121 / 1332 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1230 transition count 1606
Reduce places removed 102 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 1128 transition count 1605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 1127 transition count 1605
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 207 place count 1127 transition count 1559
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 299 place count 1081 transition count 1559
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 358 place count 1022 transition count 1500
Iterating global reduction 3 with 59 rules applied. Total rules applied 417 place count 1022 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 424 place count 1022 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 424 place count 1022 transition count 1492
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 426 place count 1021 transition count 1492
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 437 place count 1010 transition count 1481
Iterating global reduction 4 with 11 rules applied. Total rules applied 448 place count 1010 transition count 1481
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 459 place count 1010 transition count 1470
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 699 place count 890 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 700 place count 889 transition count 1349
Iterating global reduction 5 with 1 rules applied. Total rules applied 701 place count 889 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 702 place count 889 transition count 1348
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 721 place count 889 transition count 1329
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 722 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 724 place count 887 transition count 1327
Applied a total of 724 rules in 252 ms. Remains 887 /1332 variables (removed 445) and now considering 1327/1811 (removed 484) transitions.
[2023-03-11 23:28:42] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2023-03-11 23:28:42] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-11 23:28:43] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-11 23:28:43] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:43] [INFO ] Invariant cache hit.
[2023-03-11 23:28:44] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2023-03-11 23:28:44] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:44] [INFO ] Invariant cache hit.
[2023-03-11 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 887/1332 places, 1327/1811 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2171 ms. Remains : 887/1332 places, 1327/1811 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s410 0), p0:(EQ s24 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 3769 reset in 1147 ms.
Product exploration explored 100000 steps with 3771 reset in 1166 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)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 320423 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320423 steps, saw 85635 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 23:28:50] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:50] [INFO ] Invariant cache hit.
[2023-03-11 23:28:51] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 23:28:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-11 23:28:51] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 23:28:51] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-11 23:28:51] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t375.t1379.t1195 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 4 transition count 4
Applied a total of 931 rules in 132 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 19 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-11 23:28:52] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:52] [INFO ] Invariant cache hit.
[2023-03-11 23:28:52] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-11 23:28:52] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:52] [INFO ] Invariant cache hit.
[2023-03-11 23:28:53] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-03-11 23:28:53] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:53] [INFO ] Invariant cache hit.
[2023-03-11 23:28:54] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 887/887 places, 1327/1327 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 385 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 322741 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322741 steps, saw 86278 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 23:28:58] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:28:58] [INFO ] Invariant cache hit.
[2023-03-11 23:28:58] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 23:28:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-11 23:28:58] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 23:28:59] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-11 23:28:59] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t375.t1379.t1195 and 90 places that fell out of Prefix Of Interest.
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 931 place count 4 transition count 4
Applied a total of 931 rules in 124 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 4/887 places, 4/1327 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3784 reset in 1150 ms.
Product exploration explored 100000 steps with 3799 reset in 1168 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 78 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-11 23:29:02] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 23:29:02] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:29:02] [INFO ] Invariant cache hit.
[2023-03-11 23:29:03] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 887/887 places, 1327/1327 transitions.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 16 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-11 23:29:03] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:29:03] [INFO ] Invariant cache hit.
[2023-03-11 23:29:03] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-11 23:29:03] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:29:03] [INFO ] Invariant cache hit.
[2023-03-11 23:29:04] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
[2023-03-11 23:29:04] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2023-03-11 23:29:04] [INFO ] Invariant cache hit.
[2023-03-11 23:29:04] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 887/887 places, 1327/1327 transitions.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 22622 ms.
[2023-03-11 23:29:05] [INFO ] Flatten gal took : 84 ms
[2023-03-11 23:29:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 23:29:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1332 places, 1811 transitions and 5443 arcs took 18 ms.
Total runtime 130452 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2073/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2073/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-20b-LTLFireability-01
Could not compute solution for formula : FlexibleBarrier-PT-20b-LTLFireability-14

BK_STOP 1678577347940

--------------------
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-20b-LTLFireability-01
ltl formula formula --ltl=/tmp/2073/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 1332 places, 1811 transitions and 5443 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.400 real 0.070 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2073/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2073/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2073/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2073/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name FlexibleBarrier-PT-20b-LTLFireability-14
ltl formula formula --ltl=/tmp/2073/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 1332 places, 1811 transitions and 5443 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2073/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2073/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2073/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2073/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

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