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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:33 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.9K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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.8M 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-22b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678581619871

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-22b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 00:40:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 00:40:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:40:21] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2023-03-12 00:40:21] [INFO ] Transformed 6478 places.
[2023-03-12 00:40:21] [INFO ] Transformed 7469 transitions.
[2023-03-12 00:40:21] [INFO ] Found NUPN structural information;
[2023-03-12 00:40:21] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 6478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Discarding 2751 places :
Symmetric choice reduction at 0 with 2751 rule applications. Total rules 2751 place count 3727 transition count 4718
Iterating global reduction 0 with 2751 rules applied. Total rules applied 5502 place count 3727 transition count 4718
Discarding 1310 places :
Symmetric choice reduction at 0 with 1310 rule applications. Total rules 6812 place count 2417 transition count 3408
Iterating global reduction 0 with 1310 rules applied. Total rules applied 8122 place count 2417 transition count 3408
Discarding 857 places :
Symmetric choice reduction at 0 with 857 rule applications. Total rules 8979 place count 1560 transition count 2551
Iterating global reduction 0 with 857 rules applied. Total rules applied 9836 place count 1560 transition count 2551
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Iterating post reduction 0 with 421 rules applied. Total rules applied 10257 place count 1560 transition count 2130
Applied a total of 10257 rules in 1652 ms. Remains 1560 /6478 variables (removed 4918) and now considering 2130/7469 (removed 5339) transitions.
// Phase 1: matrix 2130 rows 1560 cols
[2023-03-12 00:40:23] [INFO ] Computed 24 place invariants in 84 ms
[2023-03-12 00:40:24] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-12 00:40:24] [INFO ] Invariant cache hit.
[2023-03-12 00:40:26] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
[2023-03-12 00:40:26] [INFO ] Invariant cache hit.
[2023-03-12 00:40:27] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1560/6478 places, 2130/7469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5110 ms. Remains : 1560/6478 places, 2130/7469 transitions.
Support contains 44 out of 1560 places after structural reductions.
[2023-03-12 00:40:27] [INFO ] Flatten gal took : 159 ms
[2023-03-12 00:40:27] [INFO ] Flatten gal took : 89 ms
[2023-03-12 00:40:27] [INFO ] Input system was already deterministic with 2130 transitions.
Support contains 40 out of 1560 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 32) seen :8
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-12 00:40:28] [INFO ] Invariant cache hit.
[2023-03-12 00:40:29] [INFO ] [Real]Absence check using 24 positive place invariants in 20 ms returned sat
[2023-03-12 00:40:29] [INFO ] After 1233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 00:40:30] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:40:33] [INFO ] After 2046ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 00:40:33] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 4 ms to minimize.
[2023-03-12 00:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-12 00:40:34] [INFO ] Deduced a trap composed of 500 places in 535 ms of which 2 ms to minimize.
[2023-03-12 00:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 671 ms
[2023-03-12 00:40:35] [INFO ] Deduced a trap composed of 496 places in 558 ms of which 2 ms to minimize.
[2023-03-12 00:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2023-03-12 00:40:36] [INFO ] Deduced a trap composed of 499 places in 520 ms of which 2 ms to minimize.
[2023-03-12 00:40:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 649 ms
[2023-03-12 00:40:37] [INFO ] Deduced a trap composed of 545 places in 544 ms of which 1 ms to minimize.
[2023-03-12 00:40:37] [INFO ] Deduced a trap composed of 500 places in 469 ms of which 1 ms to minimize.
[2023-03-12 00:40:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1202 ms
[2023-03-12 00:40:38] [INFO ] After 7813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1470 ms.
[2023-03-12 00:40:40] [INFO ] After 10657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 12 properties in 335 ms.
Support contains 18 out of 1560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1468 edges and 1560 vertex of which 133 / 1560 are part of one of the 22 SCC in 10 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 1449 transition count 1891
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 211 place count 1344 transition count 1891
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 211 place count 1344 transition count 1837
Deduced a syphon composed of 54 places in 6 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 319 place count 1290 transition count 1837
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 375 place count 1234 transition count 1781
Iterating global reduction 2 with 56 rules applied. Total rules applied 431 place count 1234 transition count 1781
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 433 place count 1234 transition count 1779
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 444 place count 1223 transition count 1768
Iterating global reduction 3 with 11 rules applied. Total rules applied 455 place count 1223 transition count 1768
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 463 place count 1223 transition count 1760
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 737 place count 1086 transition count 1623
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 781 place count 1086 transition count 1579
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 805 place count 1062 transition count 1555
Iterating global reduction 5 with 24 rules applied. Total rules applied 829 place count 1062 transition count 1555
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 831 place count 1062 transition count 1553
Free-agglomeration rule applied 925 times.
Iterating global reduction 6 with 925 rules applied. Total rules applied 1756 place count 1062 transition count 628
Reduce places removed 925 places and 0 transitions.
Drop transitions removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Iterating post reduction 6 with 1279 rules applied. Total rules applied 3035 place count 137 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3036 place count 136 transition count 273
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 110 edges and 135 vertex of which 44 / 135 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 3038 place count 113 transition count 273
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 8 with 44 rules applied. Total rules applied 3082 place count 113 transition count 229
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 3082 place count 113 transition count 207
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 3126 place count 91 transition count 207
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 3148 place count 91 transition count 185
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 3192 place count 69 transition count 163
Free-agglomeration rule applied 22 times.
Iterating global reduction 10 with 22 rules applied. Total rules applied 3214 place count 69 transition count 141
Reduce places removed 34 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 10 with 100 rules applied. Total rules applied 3314 place count 35 transition count 75
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 11 with 33 rules applied. Total rules applied 3347 place count 35 transition count 42
Applied a total of 3347 rules in 1228 ms. Remains 35 /1560 variables (removed 1525) and now considering 42/2130 (removed 2088) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1228 ms. Remains : 35/1560 places, 42/2130 transitions.
Finished random walk after 402 steps, including 8 resets, run visited all 12 properties in 7 ms. (steps per millisecond=57 )
FORMULA FlexibleBarrier-PT-22b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(p1)))))'
Support contains 4 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1536 transition count 2106
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1536 transition count 2106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1536 transition count 2102
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 1516 transition count 2082
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 1516 transition count 2082
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 99 place count 1516 transition count 2075
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 109 place count 1506 transition count 2065
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 1506 transition count 2065
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 1506 transition count 2057
Applied a total of 127 rules in 220 ms. Remains 1506 /1560 variables (removed 54) and now considering 2057/2130 (removed 73) transitions.
// Phase 1: matrix 2057 rows 1506 cols
[2023-03-12 00:40:42] [INFO ] Computed 24 place invariants in 72 ms
[2023-03-12 00:40:43] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-12 00:40:43] [INFO ] Invariant cache hit.
[2023-03-12 00:40:44] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-12 00:40:44] [INFO ] Invariant cache hit.
[2023-03-12 00:40:45] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1560 places, 2057/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3299 ms. Remains : 1506/1560 places, 2057/2130 transitions.
Stuttering acceptance computed with spot in 508 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(NEQ s66 1), p0:(AND (EQ s208 1) (EQ s406 1) (EQ s1222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 613 ms.
Product exploration explored 100000 steps with 25000 reset in 531 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 313455 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313455 steps, saw 121878 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:40:50] [INFO ] Invariant cache hit.
[2023-03-12 00:40:50] [INFO ] [Real]Absence check using 24 positive place invariants in 16 ms returned sat
[2023-03-12 00:40:51] [INFO ] After 648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 00:40:51] [INFO ] After 793ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 00:40:51] [INFO ] After 1105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 2057/2057 transitions.
Graph (trivial) has 1436 edges and 1506 vertex of which 133 / 1506 are part of one of the 22 SCC in 8 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 1395 transition count 1817
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 1289 transition count 1817
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 213 place count 1289 transition count 1770
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 307 place count 1242 transition count 1770
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1199 transition count 1727
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1199 transition count 1727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 1199 transition count 1726
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 666 place count 1063 transition count 1590
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 710 place count 1063 transition count 1546
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 732 place count 1041 transition count 1524
Iterating global reduction 4 with 22 rules applied. Total rules applied 754 place count 1041 transition count 1524
Free-agglomeration rule applied 926 times.
Iterating global reduction 4 with 926 rules applied. Total rules applied 1680 place count 1041 transition count 598
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 4 with 1346 rules applied. Total rules applied 3026 place count 115 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3027 place count 114 transition count 177
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 110 / 112 are part of one of the 22 SCC in 0 ms
Free SCC test removed 88 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 3030 place count 24 transition count 177
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Iterating post reduction 6 with 195 rules applied. Total rules applied 3225 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3225 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3227 place count 2 transition count 2
Applied a total of 3227 rules in 410 ms. Remains 2 /1506 variables (removed 1504) and now considering 2/2057 (removed 2055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 2/1506 places, 2/2057 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 1506 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 2057/2057 transitions.
Applied a total of 0 rules in 50 ms. Remains 1506 /1506 variables (removed 0) and now considering 2057/2057 (removed 0) transitions.
[2023-03-12 00:40:52] [INFO ] Invariant cache hit.
[2023-03-12 00:40:53] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-12 00:40:53] [INFO ] Invariant cache hit.
[2023-03-12 00:40:54] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2023-03-12 00:40:55] [INFO ] Invariant cache hit.
[2023-03-12 00:40:55] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 1506/1506 places, 2057/2057 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319146 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319146 steps, saw 123461 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:40:59] [INFO ] Invariant cache hit.
[2023-03-12 00:40:59] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:41:00] [INFO ] After 620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 00:41:00] [INFO ] After 735ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 00:41:00] [INFO ] After 1043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 2057/2057 transitions.
Graph (trivial) has 1436 edges and 1506 vertex of which 133 / 1506 are part of one of the 22 SCC in 3 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 1395 transition count 1817
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 213 place count 1289 transition count 1817
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 213 place count 1289 transition count 1770
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 307 place count 1242 transition count 1770
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1199 transition count 1727
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1199 transition count 1727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 1199 transition count 1726
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 666 place count 1063 transition count 1590
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 710 place count 1063 transition count 1546
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 732 place count 1041 transition count 1524
Iterating global reduction 4 with 22 rules applied. Total rules applied 754 place count 1041 transition count 1524
Free-agglomeration rule applied 926 times.
Iterating global reduction 4 with 926 rules applied. Total rules applied 1680 place count 1041 transition count 598
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 4 with 1346 rules applied. Total rules applied 3026 place count 115 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3027 place count 114 transition count 177
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 154 edges and 112 vertex of which 110 / 112 are part of one of the 22 SCC in 0 ms
Free SCC test removed 88 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 3030 place count 24 transition count 177
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 154 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 174 transitions.
Iterating post reduction 6 with 195 rules applied. Total rules applied 3225 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3225 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3227 place count 2 transition count 2
Applied a total of 3227 rules in 397 ms. Remains 2 /1506 variables (removed 1504) and now considering 2/2057 (removed 2055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 2/1506 places, 2/2057 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 549 ms.
Product exploration explored 100000 steps with 25000 reset in 553 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 2057/2057 transitions.
Graph (trivial) has 1436 edges and 1506 vertex of which 133 / 1506 are part of one of the 22 SCC in 4 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1395 transition count 1945
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 65 Pre rules applied. Total rules applied 87 place count 1395 transition count 1945
Deduced a syphon composed of 151 places in 2 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 152 place count 1395 transition count 1945
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 257 place count 1290 transition count 1840
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 362 place count 1290 transition count 1840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 363 place count 1290 transition count 1839
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 205 places in 2 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 479 place count 1290 transition count 1883
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 527 place count 1242 transition count 1835
Deduced a syphon composed of 157 places in 1 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 575 place count 1242 transition count 1835
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 597 place count 1242 transition count 1879
Deduced a syphon composed of 179 places in 0 ms
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 2 with 44 rules applied. Total rules applied 641 place count 1242 transition count 1835
Deduced a syphon composed of 179 places in 0 ms
Applied a total of 641 rules in 1065 ms. Remains 1242 /1506 variables (removed 264) and now considering 1835/2057 (removed 222) transitions.
[2023-03-12 00:41:04] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-12 00:41:04] [INFO ] Flow matrix only has 1792 transitions (discarded 43 similar events)
// Phase 1: matrix 1792 rows 1242 cols
[2023-03-12 00:41:04] [INFO ] Computed 24 place invariants in 45 ms
[2023-03-12 00:41:04] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/1506 places, 1835/2057 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2008 ms. Remains : 1242/1506 places, 1835/2057 transitions.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 2057/2057 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1505 transition count 2056
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1505 transition count 2056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1505 transition count 2055
Applied a total of 3 rules in 151 ms. Remains 1505 /1506 variables (removed 1) and now considering 2055/2057 (removed 2) transitions.
// Phase 1: matrix 2055 rows 1505 cols
[2023-03-12 00:41:05] [INFO ] Computed 24 place invariants in 47 ms
[2023-03-12 00:41:05] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-12 00:41:05] [INFO ] Invariant cache hit.
[2023-03-12 00:41:07] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-12 00:41:07] [INFO ] Invariant cache hit.
[2023-03-12 00:41:08] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1505/1506 places, 2055/2057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3182 ms. Remains : 1505/1506 places, 2055/2057 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-00 finished in 25977 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||X((X(F(p1))||(X(G(p2)) U (p0&&X(G(p2))))))))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1537 transition count 2107
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1537 transition count 2107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 1537 transition count 2102
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1519 transition count 2084
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1519 transition count 2084
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 1519 transition count 2078
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 1510 transition count 2069
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 1510 transition count 2069
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 1510 transition count 2062
Applied a total of 118 rules in 256 ms. Remains 1510 /1560 variables (removed 50) and now considering 2062/2130 (removed 68) transitions.
// Phase 1: matrix 2062 rows 1510 cols
[2023-03-12 00:41:08] [INFO ] Computed 24 place invariants in 48 ms
[2023-03-12 00:41:09] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-12 00:41:09] [INFO ] Invariant cache hit.
[2023-03-12 00:41:10] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2023-03-12 00:41:10] [INFO ] Invariant cache hit.
[2023-03-12 00:41:11] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1560 places, 2062/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3383 ms. Remains : 1510/1560 places, 2062/2130 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s782 1), p2:(EQ s308 1), p0:(EQ s774 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-01 finished in 3742 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)||(p0&&G((F(p1)&&F(G(!p0))))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1537 transition count 2107
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1537 transition count 2107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 1537 transition count 2102
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1519 transition count 2084
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1519 transition count 2084
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 93 place count 1519 transition count 2078
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 1510 transition count 2069
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 1510 transition count 2069
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 119 place count 1510 transition count 2061
Applied a total of 119 rules in 243 ms. Remains 1510 /1560 variables (removed 50) and now considering 2061/2130 (removed 69) transitions.
// Phase 1: matrix 2061 rows 1510 cols
[2023-03-12 00:41:12] [INFO ] Computed 24 place invariants in 42 ms
[2023-03-12 00:41:12] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-12 00:41:12] [INFO ] Invariant cache hit.
[2023-03-12 00:41:14] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2023-03-12 00:41:14] [INFO ] Invariant cache hit.
[2023-03-12 00:41:15] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1560 places, 2061/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3318 ms. Remains : 1510/1560 places, 2061/2130 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s543 1), p1:(NEQ s1450 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 673 reset in 391 ms.
Product exploration explored 100000 steps with 673 reset in 471 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 241233 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241233 steps, saw 103113 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 00:41:20] [INFO ] Invariant cache hit.
[2023-03-12 00:41:20] [INFO ] [Real]Absence check using 24 positive place invariants in 19 ms returned sat
[2023-03-12 00:41:21] [INFO ] After 751ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 00:41:21] [INFO ] After 862ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 00:41:21] [INFO ] After 1237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-12 00:41:21] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:41:22] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 00:41:22] [INFO ] After 1057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-12 00:41:23] [INFO ] After 1544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Graph (trivial) has 1439 edges and 1510 vertex of which 133 / 1510 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1399 transition count 1820
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1292 transition count 1820
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1292 transition count 1774
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 307 place count 1246 transition count 1774
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1203 transition count 1731
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1203 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1202 transition count 1730
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1202 transition count 1730
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 669 place count 1065 transition count 1593
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 713 place count 1065 transition count 1549
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 735 place count 1043 transition count 1527
Iterating global reduction 3 with 22 rules applied. Total rules applied 757 place count 1043 transition count 1527
Free-agglomeration rule applied 927 times.
Iterating global reduction 3 with 927 rules applied. Total rules applied 1684 place count 1043 transition count 600
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 319 edges and 116 vertex of which 26 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1368 rules applied. Total rules applied 3052 place count 26 transition count 160
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 4 with 126 rules applied. Total rules applied 3178 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3179 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 3181 place count 20 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3189 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 3189 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3197 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3201 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3209 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3213 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 3224 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3225 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3226 place count 4 transition count 4
Applied a total of 3226 rules in 412 ms. Remains 4 /1510 variables (removed 1506) and now considering 4/2061 (removed 2057) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 4/1510 places, 4/2061 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1510 /1510 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-12 00:41:24] [INFO ] Invariant cache hit.
[2023-03-12 00:41:24] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-12 00:41:24] [INFO ] Invariant cache hit.
[2023-03-12 00:41:26] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
[2023-03-12 00:41:26] [INFO ] Invariant cache hit.
[2023-03-12 00:41:27] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3127 ms. Remains : 1510/1510 places, 2061/2061 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 251418 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251418 steps, saw 105589 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 00:41:30] [INFO ] Invariant cache hit.
[2023-03-12 00:41:31] [INFO ] [Real]Absence check using 24 positive place invariants in 23 ms returned sat
[2023-03-12 00:41:32] [INFO ] After 753ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 00:41:32] [INFO ] After 859ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 00:41:32] [INFO ] After 1254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-12 00:41:32] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:41:33] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 00:41:33] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-12 00:41:33] [INFO ] After 1558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Graph (trivial) has 1439 edges and 1510 vertex of which 133 / 1510 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1399 transition count 1820
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1292 transition count 1820
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 215 place count 1292 transition count 1774
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 307 place count 1246 transition count 1774
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 350 place count 1203 transition count 1731
Iterating global reduction 2 with 43 rules applied. Total rules applied 393 place count 1203 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 1202 transition count 1730
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 1202 transition count 1730
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 669 place count 1065 transition count 1593
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 713 place count 1065 transition count 1549
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 735 place count 1043 transition count 1527
Iterating global reduction 3 with 22 rules applied. Total rules applied 757 place count 1043 transition count 1527
Free-agglomeration rule applied 927 times.
Iterating global reduction 3 with 927 rules applied. Total rules applied 1684 place count 1043 transition count 600
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 319 edges and 116 vertex of which 26 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1368 rules applied. Total rules applied 3052 place count 26 transition count 160
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 4 with 126 rules applied. Total rules applied 3178 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3179 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 3181 place count 20 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3189 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 3189 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3197 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3201 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 3209 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3213 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 3224 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3225 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3226 place count 4 transition count 4
Applied a total of 3226 rules in 397 ms. Remains 4 /1510 variables (removed 1506) and now considering 4/2061 (removed 2057) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 4/1510 places, 4/2061 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 674 reset in 342 ms.
Product exploration explored 100000 steps with 676 reset in 354 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Graph (trivial) has 1439 edges and 1510 vertex of which 133 / 1510 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1399 transition count 1949
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 65 Pre rules applied. Total rules applied 88 place count 1399 transition count 1949
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 153 place count 1399 transition count 1949
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 259 place count 1293 transition count 1843
Deduced a syphon composed of 89 places in 2 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 365 place count 1293 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 366 place count 1292 transition count 1842
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 367 place count 1292 transition count 1842
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 483 place count 1292 transition count 1886
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 531 place count 1244 transition count 1838
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 579 place count 1244 transition count 1838
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 601 place count 1244 transition count 1882
Deduced a syphon composed of 179 places in 0 ms
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 645 place count 1244 transition count 1838
Deduced a syphon composed of 179 places in 1 ms
Applied a total of 645 rules in 518 ms. Remains 1244 /1510 variables (removed 266) and now considering 1838/2061 (removed 223) transitions.
[2023-03-12 00:41:36] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-12 00:41:36] [INFO ] Flow matrix only has 1795 transitions (discarded 43 similar events)
// Phase 1: matrix 1795 rows 1244 cols
[2023-03-12 00:41:36] [INFO ] Computed 24 place invariants in 54 ms
[2023-03-12 00:41:37] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1510 places, 1838/2061 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1422 ms. Remains : 1244/1510 places, 1838/2061 transitions.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1510 /1510 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
// Phase 1: matrix 2061 rows 1510 cols
[2023-03-12 00:41:37] [INFO ] Computed 24 place invariants in 48 ms
[2023-03-12 00:41:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-12 00:41:38] [INFO ] Invariant cache hit.
[2023-03-12 00:41:39] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2023-03-12 00:41:39] [INFO ] Invariant cache hit.
[2023-03-12 00:41:40] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3159 ms. Remains : 1510/1510 places, 2061/2061 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-03 finished in 28764 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)||G((p1||(X(F(p2)) U G(p3)))))))'
Support contains 4 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1444 edges and 1560 vertex of which 121 / 1560 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 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 1458 transition count 1915
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 1346 transition count 1915
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 225 place count 1346 transition count 1860
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 335 place count 1291 transition count 1860
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 397 place count 1229 transition count 1798
Iterating global reduction 2 with 62 rules applied. Total rules applied 459 place count 1229 transition count 1798
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 464 place count 1229 transition count 1793
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 464 place count 1229 transition count 1792
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 466 place count 1228 transition count 1792
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 479 place count 1215 transition count 1779
Iterating global reduction 3 with 13 rules applied. Total rules applied 492 place count 1215 transition count 1779
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 503 place count 1215 transition count 1768
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 783 place count 1075 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 785 place count 1073 transition count 1626
Iterating global reduction 4 with 2 rules applied. Total rules applied 787 place count 1073 transition count 1626
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 789 place count 1073 transition count 1624
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 793 place count 1071 transition count 1624
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 817 place count 1071 transition count 1600
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 819 place count 1069 transition count 1598
Applied a total of 819 rules in 606 ms. Remains 1069 /1560 variables (removed 491) and now considering 1598/2130 (removed 532) transitions.
[2023-03-12 00:41:41] [INFO ] Flow matrix only has 1557 transitions (discarded 41 similar events)
// Phase 1: matrix 1557 rows 1069 cols
[2023-03-12 00:41:41] [INFO ] Computed 24 place invariants in 51 ms
[2023-03-12 00:41:41] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-12 00:41:41] [INFO ] Flow matrix only has 1557 transitions (discarded 41 similar events)
[2023-03-12 00:41:41] [INFO ] Invariant cache hit.
[2023-03-12 00:41:43] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2023-03-12 00:41:43] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-12 00:41:43] [INFO ] Flow matrix only has 1557 transitions (discarded 41 similar events)
[2023-03-12 00:41:43] [INFO ] Invariant cache hit.
[2023-03-12 00:41:43] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1069/1560 places, 1598/2130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3100 ms. Remains : 1069/1560 places, 1598/2130 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p1 (NOT p2)) (AND p0 p3 (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p3 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={2} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={0, 2} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={0, 2} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s311 1), p3:(EQ s509 1), p0:(EQ s595 1), p2:(EQ s225 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-04 finished in 3331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!p1&&X((!p0||X(G(p2)))))))'
Support contains 5 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1537 transition count 2107
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1537 transition count 2107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 1537 transition count 2103
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 69 place count 1518 transition count 2084
Iterating global reduction 1 with 19 rules applied. Total rules applied 88 place count 1518 transition count 2084
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 1518 transition count 2077
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 104 place count 1509 transition count 2068
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 1509 transition count 2068
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 121 place count 1509 transition count 2060
Applied a total of 121 rules in 208 ms. Remains 1509 /1560 variables (removed 51) and now considering 2060/2130 (removed 70) transitions.
// Phase 1: matrix 2060 rows 1509 cols
[2023-03-12 00:41:44] [INFO ] Computed 24 place invariants in 45 ms
[2023-03-12 00:41:45] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-12 00:41:45] [INFO ] Invariant cache hit.
[2023-03-12 00:41:46] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2023-03-12 00:41:46] [INFO ] Invariant cache hit.
[2023-03-12 00:41:47] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1509/1560 places, 2060/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3290 ms. Remains : 1509/1560 places, 2060/2130 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR p1 (AND p0 (NOT p2))), (NOT p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s510 1) (EQ s726 1) (EQ s1275 1)), p0:(EQ s441 1), p2:(EQ s1143 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 50000 reset in 956 ms.
Product exploration explored 100000 steps with 50000 reset in 1022 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) (NOT p2))
Knowledge based reduction with 21 factoid took 646 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-22b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-05 finished in 6208 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(((p1||X(G(p2)))&&p0))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1487 edges and 1560 vertex of which 133 / 1560 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 1448 transition count 1906
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 1337 transition count 1906
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 223 place count 1337 transition count 1852
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 331 place count 1283 transition count 1852
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 396 place count 1218 transition count 1787
Iterating global reduction 2 with 65 rules applied. Total rules applied 461 place count 1218 transition count 1787
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 466 place count 1218 transition count 1782
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 466 place count 1218 transition count 1781
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 468 place count 1217 transition count 1781
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 481 place count 1204 transition count 1768
Iterating global reduction 3 with 13 rules applied. Total rules applied 494 place count 1204 transition count 1768
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 506 place count 1204 transition count 1756
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 774 place count 1070 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 775 place count 1069 transition count 1621
Iterating global reduction 4 with 1 rules applied. Total rules applied 776 place count 1069 transition count 1621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 777 place count 1069 transition count 1620
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 799 place count 1069 transition count 1598
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 801 place count 1067 transition count 1596
Applied a total of 801 rules in 574 ms. Remains 1067 /1560 variables (removed 493) and now considering 1596/2130 (removed 534) transitions.
[2023-03-12 00:41:50] [INFO ] Flow matrix only has 1553 transitions (discarded 43 similar events)
// Phase 1: matrix 1553 rows 1067 cols
[2023-03-12 00:41:50] [INFO ] Computed 24 place invariants in 42 ms
[2023-03-12 00:41:51] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-12 00:41:51] [INFO ] Flow matrix only has 1553 transitions (discarded 43 similar events)
[2023-03-12 00:41:51] [INFO ] Invariant cache hit.
[2023-03-12 00:41:52] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2023-03-12 00:41:52] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 00:41:52] [INFO ] Flow matrix only has 1553 transitions (discarded 43 similar events)
[2023-03-12 00:41:52] [INFO ] Invariant cache hit.
[2023-03-12 00:41:53] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1067/1560 places, 1596/2130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3140 ms. Remains : 1067/1560 places, 1596/2130 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s933 0), p0:(AND (EQ s28 1) (EQ s542 1)), p2:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-08 finished in 3237 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||X(F(p1))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1469 edges and 1560 vertex of which 127 / 1560 are part of one of the 21 SCC in 2 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 1453 transition count 1909
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 227 place count 1340 transition count 1909
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 227 place count 1340 transition count 1854
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 337 place count 1285 transition count 1854
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 402 place count 1220 transition count 1789
Iterating global reduction 2 with 65 rules applied. Total rules applied 467 place count 1220 transition count 1789
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 472 place count 1220 transition count 1784
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 472 place count 1220 transition count 1783
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 474 place count 1219 transition count 1783
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 487 place count 1206 transition count 1770
Iterating global reduction 3 with 13 rules applied. Total rules applied 500 place count 1206 transition count 1770
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 512 place count 1206 transition count 1758
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 786 place count 1069 transition count 1621
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 788 place count 1067 transition count 1619
Iterating global reduction 4 with 2 rules applied. Total rules applied 790 place count 1067 transition count 1619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 792 place count 1067 transition count 1617
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 794 place count 1066 transition count 1617
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 817 place count 1066 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 819 place count 1064 transition count 1592
Applied a total of 819 rules in 593 ms. Remains 1064 /1560 variables (removed 496) and now considering 1592/2130 (removed 538) transitions.
[2023-03-12 00:41:54] [INFO ] Flow matrix only has 1550 transitions (discarded 42 similar events)
// Phase 1: matrix 1550 rows 1064 cols
[2023-03-12 00:41:54] [INFO ] Computed 24 place invariants in 49 ms
[2023-03-12 00:41:54] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-12 00:41:54] [INFO ] Flow matrix only has 1550 transitions (discarded 42 similar events)
[2023-03-12 00:41:54] [INFO ] Invariant cache hit.
[2023-03-12 00:41:56] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-12 00:41:56] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 00:41:56] [INFO ] Flow matrix only has 1550 transitions (discarded 42 similar events)
[2023-03-12 00:41:56] [INFO ] Invariant cache hit.
[2023-03-12 00:41:56] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1064/1560 places, 1592/2130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3091 ms. Remains : 1064/1560 places, 1592/2130 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s113 1), p1:(EQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-09 finished in 3190 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 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1490 edges and 1560 vertex of which 133 / 1560 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 1448 transition count 1905
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 1336 transition count 1905
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 225 place count 1336 transition count 1850
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 335 place count 1281 transition count 1850
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 402 place count 1214 transition count 1783
Iterating global reduction 2 with 67 rules applied. Total rules applied 469 place count 1214 transition count 1783
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 474 place count 1214 transition count 1778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 474 place count 1214 transition count 1777
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 476 place count 1213 transition count 1777
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 489 place count 1200 transition count 1764
Iterating global reduction 3 with 13 rules applied. Total rules applied 502 place count 1200 transition count 1764
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 515 place count 1200 transition count 1751
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 783 place count 1066 transition count 1617
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 785 place count 1064 transition count 1615
Iterating global reduction 4 with 2 rules applied. Total rules applied 787 place count 1064 transition count 1615
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 789 place count 1064 transition count 1613
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 811 place count 1064 transition count 1591
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 813 place count 1062 transition count 1589
Applied a total of 813 rules in 574 ms. Remains 1062 /1560 variables (removed 498) and now considering 1589/2130 (removed 541) transitions.
[2023-03-12 00:41:57] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
// Phase 1: matrix 1546 rows 1062 cols
[2023-03-12 00:41:57] [INFO ] Computed 24 place invariants in 50 ms
[2023-03-12 00:41:57] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-12 00:41:57] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:41:57] [INFO ] Invariant cache hit.
[2023-03-12 00:41:59] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2023-03-12 00:41:59] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 00:41:59] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:41:59] [INFO ] Invariant cache hit.
[2023-03-12 00:41:59] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1062/1560 places, 1589/2130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2970 ms. Remains : 1062/1560 places, 1589/2130 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-10 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 s659 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]]
Product exploration explored 100000 steps with 3510 reset in 1512 ms.
Product exploration explored 100000 steps with 3511 reset in 1440 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 344475 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344475 steps, saw 100269 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:42:06] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:06] [INFO ] Invariant cache hit.
[2023-03-12 00:42:06] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:42:06] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:42:07] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:42:07] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 00:42:07] [INFO ] After 789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2447 place count 2 transition count 2
Applied a total of 2447 rules in 209 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 2/1062 places, 2/1589 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 116 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2023-03-12 00:42:08] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:08] [INFO ] Invariant cache hit.
[2023-03-12 00:42:08] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-12 00:42:08] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:08] [INFO ] Invariant cache hit.
[2023-03-12 00:42:09] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2023-03-12 00:42:09] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 00:42:09] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:09] [INFO ] Invariant cache hit.
[2023-03-12 00:42:10] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2599 ms. Remains : 1062/1062 places, 1589/1589 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 358 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 358886 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358886 steps, saw 103981 distinct states, run finished after 3010 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 00:42:14] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:14] [INFO ] Invariant cache hit.
[2023-03-12 00:42:14] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:42:14] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:42:15] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:42:15] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 00:42:15] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1062 transition count 1545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1040 transition count 1523
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1040 transition count 1523
Free-agglomeration rule applied 926 times.
Iterating global reduction 1 with 926 rules applied. Total rules applied 1014 place count 1040 transition count 597
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 203 edges and 113 vertex of which 13 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.5 ms
Discarding 100 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 50 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 1369 rules applied. Total rules applied 2383 place count 11 transition count 57
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2427 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2427 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2431 place count 9 transition count 11
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2433 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2437 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2439 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2445 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2445 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2447 place count 2 transition count 2
Applied a total of 2447 rules in 223 ms. Remains 2 /1062 variables (removed 1060) and now considering 2/1589 (removed 1587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 2/1062 places, 2/1589 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3516 reset in 1407 ms.
Product exploration explored 100000 steps with 3516 reset in 1409 ms.
Support contains 1 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1589/1589 transitions.
Applied a total of 0 rules in 109 ms. Remains 1062 /1062 variables (removed 0) and now considering 1589/1589 (removed 0) transitions.
[2023-03-12 00:42:18] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:18] [INFO ] Invariant cache hit.
[2023-03-12 00:42:19] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-12 00:42:19] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:19] [INFO ] Invariant cache hit.
[2023-03-12 00:42:20] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2023-03-12 00:42:20] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 00:42:20] [INFO ] Flow matrix only has 1546 transitions (discarded 43 similar events)
[2023-03-12 00:42:20] [INFO ] Invariant cache hit.
[2023-03-12 00:42:21] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2519 ms. Remains : 1062/1062 places, 1589/1589 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-10 finished in 24400 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(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1537 transition count 2107
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1537 transition count 2107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 1537 transition count 2102
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1519 transition count 2084
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1519 transition count 2084
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 1519 transition count 2077
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 1511 transition count 2069
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1511 transition count 2069
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 1511 transition count 2063
Applied a total of 116 rules in 204 ms. Remains 1511 /1560 variables (removed 49) and now considering 2063/2130 (removed 67) transitions.
// Phase 1: matrix 2063 rows 1511 cols
[2023-03-12 00:42:21] [INFO ] Computed 24 place invariants in 45 ms
[2023-03-12 00:42:21] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-12 00:42:21] [INFO ] Invariant cache hit.
[2023-03-12 00:42:23] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
[2023-03-12 00:42:23] [INFO ] Invariant cache hit.
[2023-03-12 00:42:24] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1511/1560 places, 2063/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3291 ms. Remains : 1511/1560 places, 2063/2130 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s310 1), p0:(EQ s261 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-11 finished in 3489 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||G(p1))))'
Support contains 5 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1536 transition count 2106
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1536 transition count 2106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1536 transition count 2102
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 1516 transition count 2082
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 1516 transition count 2082
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 99 place count 1516 transition count 2075
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 109 place count 1506 transition count 2065
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 1506 transition count 2065
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 1506 transition count 2057
Applied a total of 127 rules in 219 ms. Remains 1506 /1560 variables (removed 54) and now considering 2057/2130 (removed 73) transitions.
// Phase 1: matrix 2057 rows 1506 cols
[2023-03-12 00:42:24] [INFO ] Computed 24 place invariants in 44 ms
[2023-03-12 00:42:25] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-12 00:42:25] [INFO ] Invariant cache hit.
[2023-03-12 00:42:27] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2023-03-12 00:42:27] [INFO ] Invariant cache hit.
[2023-03-12 00:42:27] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1560 places, 2057/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3314 ms. Remains : 1506/1560 places, 2057/2130 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-12 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:(AND (EQ s898 1) (EQ s1505 1)), p0:(AND (EQ s748 1) (EQ s820 1) (EQ s1374 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-12 finished in 3450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G(p2)||p1)))))'
Support contains 4 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1537 transition count 2107
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1537 transition count 2107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 1537 transition count 2103
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 69 place count 1518 transition count 2084
Iterating global reduction 1 with 19 rules applied. Total rules applied 88 place count 1518 transition count 2084
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 94 place count 1518 transition count 2078
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 1508 transition count 2068
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 1508 transition count 2068
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 1508 transition count 2060
Applied a total of 122 rules in 203 ms. Remains 1508 /1560 variables (removed 52) and now considering 2060/2130 (removed 70) transitions.
// Phase 1: matrix 2060 rows 1508 cols
[2023-03-12 00:42:28] [INFO ] Computed 24 place invariants in 42 ms
[2023-03-12 00:42:28] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-12 00:42:28] [INFO ] Invariant cache hit.
[2023-03-12 00:42:30] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2023-03-12 00:42:30] [INFO ] Invariant cache hit.
[2023-03-12 00:42:31] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1560 places, 2060/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3393 ms. Remains : 1508/1560 places, 2060/2130 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1112 0), p1:(OR (EQ s752 0) (EQ s1009 0) (EQ s1380 0)), p2:(EQ s1112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 673 reset in 335 ms.
Product exploration explored 100000 steps with 675 reset in 345 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 492 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 00:42:33] [INFO ] Invariant cache hit.
[2023-03-12 00:42:33] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:42:33] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 00:42:33] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:42:34] [INFO ] After 790ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 00:42:34] [INFO ] After 1107ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-12 00:42:35] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=49 )
Parikh walk visited 3 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F p2)]
Knowledge based reduction with 14 factoid took 609 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Applied a total of 0 rules in 51 ms. Remains 1508 /1508 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
[2023-03-12 00:42:36] [INFO ] Invariant cache hit.
[2023-03-12 00:42:36] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-12 00:42:36] [INFO ] Invariant cache hit.
[2023-03-12 00:42:38] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2023-03-12 00:42:38] [INFO ] Invariant cache hit.
[2023-03-12 00:42:39] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3095 ms. Remains : 1508/1508 places, 2060/2060 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 00:42:39] [INFO ] Invariant cache hit.
[2023-03-12 00:42:40] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 00:42:40] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-12 00:42:40] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 00:42:41] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-12 00:42:41] [INFO ] After 1286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 101 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 499 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 674 reset in 343 ms.
Product exploration explored 100000 steps with 678 reset in 351 ms.
Support contains 4 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 2060/2060 transitions.
Applied a total of 0 rules in 52 ms. Remains 1508 /1508 variables (removed 0) and now considering 2060/2060 (removed 0) transitions.
[2023-03-12 00:42:42] [INFO ] Invariant cache hit.
[2023-03-12 00:42:43] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-12 00:42:43] [INFO ] Invariant cache hit.
[2023-03-12 00:42:45] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2023-03-12 00:42:45] [INFO ] Invariant cache hit.
[2023-03-12 00:42:46] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3215 ms. Remains : 1508/1508 places, 2060/2060 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-13 finished in 18083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1468 edges and 1560 vertex of which 127 / 1560 are part of one of the 21 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 1453 transition count 1910
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 225 place count 1341 transition count 1910
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 225 place count 1341 transition count 1855
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 335 place count 1286 transition count 1855
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 400 place count 1221 transition count 1790
Iterating global reduction 2 with 65 rules applied. Total rules applied 465 place count 1221 transition count 1790
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 470 place count 1221 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 470 place count 1221 transition count 1784
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 472 place count 1220 transition count 1784
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 485 place count 1207 transition count 1771
Iterating global reduction 3 with 13 rules applied. Total rules applied 498 place count 1207 transition count 1771
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 510 place count 1207 transition count 1759
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 4 with 274 rules applied. Total rules applied 784 place count 1070 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 786 place count 1068 transition count 1620
Iterating global reduction 4 with 2 rules applied. Total rules applied 788 place count 1068 transition count 1620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 790 place count 1068 transition count 1618
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 792 place count 1067 transition count 1618
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 815 place count 1067 transition count 1595
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 817 place count 1065 transition count 1593
Applied a total of 817 rules in 588 ms. Remains 1065 /1560 variables (removed 495) and now considering 1593/2130 (removed 537) transitions.
[2023-03-12 00:42:46] [INFO ] Flow matrix only has 1551 transitions (discarded 42 similar events)
// Phase 1: matrix 1551 rows 1065 cols
[2023-03-12 00:42:46] [INFO ] Computed 24 place invariants in 49 ms
[2023-03-12 00:42:47] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-12 00:42:47] [INFO ] Flow matrix only has 1551 transitions (discarded 42 similar events)
[2023-03-12 00:42:47] [INFO ] Invariant cache hit.
[2023-03-12 00:42:48] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-12 00:42:48] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 00:42:48] [INFO ] Flow matrix only has 1551 transitions (discarded 42 similar events)
[2023-03-12 00:42:48] [INFO ] Invariant cache hit.
[2023-03-12 00:42:49] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1065/1560 places, 1593/2130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3116 ms. Remains : 1065/1560 places, 1593/2130 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s421 1) (EQ s507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-14 finished in 3177 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||F(p1)))||X(F((p0&&F(p1))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1536 transition count 2106
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1536 transition count 2106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 1536 transition count 2101
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 1517 transition count 2082
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 1517 transition count 2082
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 98 place count 1517 transition count 2075
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 1508 transition count 2066
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 1508 transition count 2066
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 1508 transition count 2059
Applied a total of 123 rules in 201 ms. Remains 1508 /1560 variables (removed 52) and now considering 2059/2130 (removed 71) transitions.
// Phase 1: matrix 2059 rows 1508 cols
[2023-03-12 00:42:49] [INFO ] Computed 24 place invariants in 43 ms
[2023-03-12 00:42:50] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-12 00:42:50] [INFO ] Invariant cache hit.
[2023-03-12 00:42:51] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2023-03-12 00:42:51] [INFO ] Invariant cache hit.
[2023-03-12 00:42:52] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1560 places, 2059/2130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3342 ms. Remains : 1508/1560 places, 2059/2130 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s726 1), p1:(EQ s261 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-15 finished in 3499 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 U X(X(p1)))))'
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)||(p0&&G((F(p1)&&F(G(!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' '!(G(F(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' '!(G((p0||X((G(p2)||p1)))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-22b-LTLFireability-13
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1560/1560 places, 2130/2130 transitions.
Graph (trivial) has 1488 edges and 1560 vertex of which 133 / 1560 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 1448 transition count 1904
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 227 place count 1335 transition count 1904
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 227 place count 1335 transition count 1849
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 337 place count 1280 transition count 1849
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 403 place count 1214 transition count 1783
Iterating global reduction 2 with 66 rules applied. Total rules applied 469 place count 1214 transition count 1783
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 473 place count 1214 transition count 1779
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 473 place count 1214 transition count 1778
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 475 place count 1213 transition count 1778
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 487 place count 1201 transition count 1766
Iterating global reduction 3 with 12 rules applied. Total rules applied 499 place count 1201 transition count 1766
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 511 place count 1201 transition count 1754
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 779 place count 1067 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 781 place count 1065 transition count 1618
Iterating global reduction 4 with 2 rules applied. Total rules applied 783 place count 1065 transition count 1618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 785 place count 1065 transition count 1616
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 807 place count 1065 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 809 place count 1063 transition count 1592
Applied a total of 809 rules in 322 ms. Remains 1063 /1560 variables (removed 497) and now considering 1592/2130 (removed 538) transitions.
[2023-03-12 00:42:53] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
// Phase 1: matrix 1549 rows 1063 cols
[2023-03-12 00:42:53] [INFO ] Computed 24 place invariants in 47 ms
[2023-03-12 00:42:54] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-12 00:42:54] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:42:54] [INFO ] Invariant cache hit.
[2023-03-12 00:42:55] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2023-03-12 00:42:55] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:42:55] [INFO ] Invariant cache hit.
[2023-03-12 00:42:55] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1063/1560 places, 1592/2130 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2647 ms. Remains : 1063/1560 places, 1592/2130 transitions.
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s671 0), p1:(OR (EQ s440 0) (EQ s588 0) (EQ s939 0)), p2:(EQ s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3524 reset in 1415 ms.
Product exploration explored 100000 steps with 3520 reset in 1443 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 491 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) 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 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 00:43:00] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:00] [INFO ] Invariant cache hit.
[2023-03-12 00:43:00] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:43:00] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 00:43:00] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-12 00:43:01] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 00:43:01] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-12 00:43:01] [INFO ] After 1174ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1063 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1041 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1041 transition count 1526
Free-agglomeration rule applied 925 times.
Iterating global reduction 1 with 925 rules applied. Total rules applied 1013 place count 1041 transition count 601
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 1 with 1347 rules applied. Total rules applied 2360 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2404 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2404 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2448 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2470 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2514 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2536 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 2619 place count 7 transition count 8
Applied a total of 2619 rules in 214 ms. Remains 7 /1063 variables (removed 1056) and now considering 8/1592 (removed 1584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 7/1063 places, 8/1592 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F p2)]
Knowledge based reduction with 14 factoid took 692 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Applied a total of 0 rules in 30 ms. Remains 1063 /1063 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2023-03-12 00:43:02] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:02] [INFO ] Invariant cache hit.
[2023-03-12 00:43:03] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-12 00:43:03] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:03] [INFO ] Invariant cache hit.
[2023-03-12 00:43:04] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2023-03-12 00:43:04] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:04] [INFO ] Invariant cache hit.
[2023-03-12 00:43:05] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2447 ms. Remains : 1063/1063 places, 1592/1592 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 360 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 355 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) 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 4) seen :2
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
Running SMT prover for 2 properties.
[2023-03-12 00:43:06] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:06] [INFO ] Invariant cache hit.
[2023-03-12 00:43:06] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 00:43:06] [INFO ] [Nat]Absence check using 24 positive place invariants in 10 ms returned sat
[2023-03-12 00:43:07] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 00:43:07] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-12 00:43:07] [INFO ] After 949ms 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 2 ms.
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1063 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1041 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1041 transition count 1526
Free-agglomeration rule applied 925 times.
Iterating global reduction 1 with 925 rules applied. Total rules applied 1013 place count 1041 transition count 601
Reduce places removed 926 places and 0 transitions.
Drop transitions removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Graph (trivial) has 110 edges and 115 vertex of which 44 / 115 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 1 with 1347 rules applied. Total rules applied 2360 place count 93 transition count 181
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2404 place count 93 transition count 137
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2404 place count 93 transition count 115
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 2448 place count 71 transition count 115
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 2470 place count 71 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2514 place count 49 transition count 71
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2536 place count 49 transition count 49
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 2619 place count 7 transition count 8
Applied a total of 2619 rules in 227 ms. Remains 7 /1063 variables (removed 1056) and now considering 8/1592 (removed 1584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 7/1063 places, 8/1592 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 430 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3515 reset in 1402 ms.
Product exploration explored 100000 steps with 3520 reset in 1401 ms.
Support contains 4 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1592/1592 transitions.
Applied a total of 0 rules in 27 ms. Remains 1063 /1063 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2023-03-12 00:43:11] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:11] [INFO ] Invariant cache hit.
[2023-03-12 00:43:12] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-12 00:43:12] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:12] [INFO ] Invariant cache hit.
[2023-03-12 00:43:13] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-12 00:43:13] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2023-03-12 00:43:13] [INFO ] Invariant cache hit.
[2023-03-12 00:43:14] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2495 ms. Remains : 1063/1063 places, 1592/1592 transitions.
Treatment of property FlexibleBarrier-PT-22b-LTLFireability-13 finished in 21000 ms.
[2023-03-12 00:43:14] [INFO ] Flatten gal took : 84 ms
[2023-03-12 00:43:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 00:43:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1560 places, 2130 transitions and 6435 arcs took 30 ms.
Total runtime 172910 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2215/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2215/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2215/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2215/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLFireability-00
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLFireability-03
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLFireability-10
Could not compute solution for formula : FlexibleBarrier-PT-22b-LTLFireability-13

BK_STOP 1678581797759

--------------------
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-22b-LTLFireability-00
ltl formula formula --ltl=/tmp/2215/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 1560 places, 2130 transitions and 6435 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.210 real 0.050 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2215/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2215/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2215/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2215/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 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:
ltl formula name FlexibleBarrier-PT-22b-LTLFireability-03
ltl formula formula --ltl=/tmp/2215/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 1560 places, 2130 transitions and 6435 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.220 real 0.050 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2215/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2215/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2215/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2215/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 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-22b-LTLFireability-10
ltl formula formula --ltl=/tmp/2215/ltl_2_
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 1560 places, 2130 transitions and 6435 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.200 real 0.080 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2215/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2215/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2215/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2215/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x5631173c73f4]
1: pnml2lts-mc(+0xa2496) [0x5631173c7496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8a752e3140]
3: pnml2lts-mc(+0x405be5) [0x56311772abe5]
4: pnml2lts-mc(+0x16b3f9) [0x5631174903f9]
5: pnml2lts-mc(+0x164ac4) [0x563117489ac4]
6: pnml2lts-mc(+0x272e0a) [0x563117597e0a]
7: pnml2lts-mc(+0xb61f0) [0x5631173db1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8a751364d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8a7513667a]
10: pnml2lts-mc(+0xa1581) [0x5631173c6581]
11: pnml2lts-mc(+0xa1910) [0x5631173c6910]
12: pnml2lts-mc(+0xa32a2) [0x5631173c82a2]
13: pnml2lts-mc(+0xa50f4) [0x5631173ca0f4]
14: pnml2lts-mc(+0x3f34b3) [0x5631177184b3]
15: pnml2lts-mc(+0x7c63d) [0x5631173a163d]
16: pnml2lts-mc(+0x67d86) [0x56311738cd86]
17: pnml2lts-mc(+0x60a8a) [0x563117385a8a]
18: pnml2lts-mc(+0x5eb15) [0x563117383b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8a7511ed0a]
20: pnml2lts-mc(+0x6075e) [0x56311738575e]
ltl formula name FlexibleBarrier-PT-22b-LTLFireability-13
ltl formula formula --ltl=/tmp/2215/ltl_3_
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 1560 places, 2130 transitions and 6435 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.210 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2215/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2215/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2215/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2215/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 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-22b"
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-22b, 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-167838856100596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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