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.r009-oct2-167813598000475.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 266K 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 AutoFlight-PT-12b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678631360741

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:29:24] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-12 14:29:24] [INFO ] Transformed 1126 places.
[2023-03-12 14:29:24] [INFO ] Transformed 1124 transitions.
[2023-03-12 14:29:24] [INFO ] Found NUPN structural information;
[2023-03-12 14:29:24] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-12b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 972 transition count 970
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 972 transition count 970
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 332 place count 972 transition count 946
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 399 place count 905 transition count 879
Iterating global reduction 1 with 67 rules applied. Total rules applied 466 place count 905 transition count 879
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 477 place count 894 transition count 868
Iterating global reduction 1 with 11 rules applied. Total rules applied 488 place count 894 transition count 868
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 497 place count 885 transition count 859
Iterating global reduction 1 with 9 rules applied. Total rules applied 506 place count 885 transition count 859
Applied a total of 506 rules in 606 ms. Remains 885 /1126 variables (removed 241) and now considering 859/1124 (removed 265) transitions.
// Phase 1: matrix 859 rows 885 cols
[2023-03-12 14:29:25] [INFO ] Computed 76 place invariants in 59 ms
[2023-03-12 14:29:26] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-12 14:29:26] [INFO ] Invariant cache hit.
[2023-03-12 14:29:28] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 3055 ms to find 0 implicit places.
[2023-03-12 14:29:28] [INFO ] Invariant cache hit.
[2023-03-12 14:29:28] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 885/1126 places, 859/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4427 ms. Remains : 885/1126 places, 859/1124 transitions.
Support contains 26 out of 885 places after structural reductions.
[2023-03-12 14:29:29] [INFO ] Flatten gal took : 150 ms
[2023-03-12 14:29:29] [INFO ] Flatten gal took : 119 ms
[2023-03-12 14:29:29] [INFO ] Input system was already deterministic with 859 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:29:30] [INFO ] Invariant cache hit.
[2023-03-12 14:29:30] [INFO ] [Real]Absence check using 75 positive place invariants in 137 ms returned sat
[2023-03-12 14:29:30] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:29:30] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:29:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-12 14:29:30] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:29:31] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:29:32] [INFO ] Deduced a trap composed of 32 places in 422 ms of which 29 ms to minimize.
[2023-03-12 14:29:32] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 1 ms to minimize.
[2023-03-12 14:29:34] [INFO ] Deduced a trap composed of 62 places in 1730 ms of which 1 ms to minimize.
[2023-03-12 14:29:34] [INFO ] Deduced a trap composed of 80 places in 610 ms of which 2 ms to minimize.
[2023-03-12 14:29:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3320 ms
[2023-03-12 14:29:35] [INFO ] Deduced a trap composed of 68 places in 528 ms of which 1 ms to minimize.
[2023-03-12 14:29:36] [INFO ] Deduced a trap composed of 153 places in 448 ms of which 1 ms to minimize.
[2023-03-12 14:29:36] [INFO ] Deduced a trap composed of 149 places in 296 ms of which 0 ms to minimize.
[2023-03-12 14:29:37] [INFO ] Deduced a trap composed of 142 places in 668 ms of which 24 ms to minimize.
[2023-03-12 14:29:37] [INFO ] Deduced a trap composed of 149 places in 301 ms of which 1 ms to minimize.
[2023-03-12 14:29:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2511 ms
[2023-03-12 14:29:37] [INFO ] After 6675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-12 14:29:37] [INFO ] After 7303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 49 ms.
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 885/885 places, 859/859 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 315 place count 885 transition count 544
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 352 rules applied. Total rules applied 667 place count 570 transition count 507
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 692 place count 546 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 693 place count 545 transition count 506
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 693 place count 545 transition count 402
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 901 place count 441 transition count 402
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 903 place count 439 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 905 place count 439 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 905 place count 439 transition count 398
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 909 place count 437 transition count 398
Performed 169 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1247 place count 268 transition count 206
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1295 place count 268 transition count 158
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1343 place count 220 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1344 place count 219 transition count 157
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 5 with 61 rules applied. Total rules applied 1405 place count 187 transition count 128
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 30 rules applied. Total rules applied 1435 place count 158 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1436 place count 157 transition count 127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1436 place count 157 transition count 110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1470 place count 140 transition count 110
Applied a total of 1470 rules in 151 ms. Remains 140 /885 variables (removed 745) and now considering 110/859 (removed 749) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 140/885 places, 110/859 transitions.
Finished random walk after 91 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=45 )
Computed a total of 215 stabilizing places and 215 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(G(p0)))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 878 transition count 852
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 875 transition count 849
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 875 transition count 849
Applied a total of 20 rules in 182 ms. Remains 875 /885 variables (removed 10) and now considering 849/859 (removed 10) transitions.
// Phase 1: matrix 849 rows 875 cols
[2023-03-12 14:29:38] [INFO ] Computed 76 place invariants in 7 ms
[2023-03-12 14:29:39] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-12 14:29:39] [INFO ] Invariant cache hit.
[2023-03-12 14:29:40] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
[2023-03-12 14:29:40] [INFO ] Invariant cache hit.
[2023-03-12 14:29:41] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 875/885 places, 849/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3403 ms. Remains : 875/885 places, 849/859 transitions.
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s127 0) (EQ s731 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-02 finished in 3970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((X(p0) U p1)||p1)))))'
Support contains 3 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 878 transition count 852
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 873 transition count 847
Applied a total of 24 rules in 172 ms. Remains 873 /885 variables (removed 12) and now considering 847/859 (removed 12) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:29:42] [INFO ] Computed 76 place invariants in 29 ms
[2023-03-12 14:29:42] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-12 14:29:43] [INFO ] Invariant cache hit.
[2023-03-12 14:29:44] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2023-03-12 14:29:44] [INFO ] Invariant cache hit.
[2023-03-12 14:29:44] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2487 ms. Remains : 873/885 places, 847/859 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s157 1), p0:(OR (EQ s280 0) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 341 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-03 finished in 2843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))&&p0)))'
Support contains 4 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 880 transition count 854
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 880 transition count 854
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 879 transition count 853
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 879 transition count 853
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 878 transition count 852
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 878 transition count 852
Applied a total of 14 rules in 199 ms. Remains 878 /885 variables (removed 7) and now considering 852/859 (removed 7) transitions.
// Phase 1: matrix 852 rows 878 cols
[2023-03-12 14:29:45] [INFO ] Computed 76 place invariants in 5 ms
[2023-03-12 14:29:45] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 14:29:45] [INFO ] Invariant cache hit.
[2023-03-12 14:29:46] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2023-03-12 14:29:46] [INFO ] Invariant cache hit.
[2023-03-12 14:29:47] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 878/885 places, 852/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2042 ms. Remains : 878/885 places, 852/859 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s223 0) (EQ s201 1)), p0:(AND (NEQ s487 0) (NEQ s96 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-04 finished in 2243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 878 transition count 852
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 873 transition count 847
Applied a total of 24 rules in 155 ms. Remains 873 /885 variables (removed 12) and now considering 847/859 (removed 12) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:29:47] [INFO ] Computed 76 place invariants in 18 ms
[2023-03-12 14:29:49] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2023-03-12 14:29:49] [INFO ] Invariant cache hit.
[2023-03-12 14:29:50] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2023-03-12 14:29:50] [INFO ] Invariant cache hit.
[2023-03-12 14:29:51] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4043 ms. Remains : 873/885 places, 847/859 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s448 0) (NEQ s768 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 539 steps with 0 reset in 6 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-05 finished in 4194 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 5 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 884 transition count 545
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 349 rules applied. Total rules applied 662 place count 571 transition count 509
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 25 rules applied. Total rules applied 687 place count 548 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 689 place count 546 transition count 507
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 689 place count 546 transition count 405
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 893 place count 444 transition count 405
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 898 place count 439 transition count 400
Iterating global reduction 4 with 5 rules applied. Total rules applied 903 place count 439 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 903 place count 439 transition count 397
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 909 place count 436 transition count 397
Performed 169 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1247 place count 267 transition count 205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1248 place count 266 transition count 204
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 31 rules applied. Total rules applied 1279 place count 244 transition count 195
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 1289 place count 235 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1290 place count 234 transition count 194
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1290 place count 234 transition count 183
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1312 place count 223 transition count 183
Applied a total of 1312 rules in 143 ms. Remains 223 /885 variables (removed 662) and now considering 183/859 (removed 676) transitions.
// Phase 1: matrix 183 rows 223 cols
[2023-03-12 14:29:51] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-12 14:29:52] [INFO ] Implicit Places using invariants in 274 ms returned [91, 131, 169, 173, 177, 181, 186, 190, 194, 198, 202, 206, 217, 222]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 289 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/885 places, 183/859 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 197 transition count 171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 197 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 196 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 196 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 195 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 195 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 194 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 194 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 193 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 193 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 192 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 191 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 190 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 190 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 189 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 189 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 188 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 188 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 187 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 187 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 186 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 186 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 185 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 185 transition count 159
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 0 with 4 rules applied. Total rules applied 52 place count 183 transition count 157
Applied a total of 52 rules in 32 ms. Remains 183 /209 variables (removed 26) and now considering 157/183 (removed 26) transitions.
// Phase 1: matrix 157 rows 183 cols
[2023-03-12 14:29:52] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-12 14:29:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 14:29:52] [INFO ] Invariant cache hit.
[2023-03-12 14:29:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:29:52] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 183/885 places, 157/859 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 834 ms. Remains : 183/885 places, 157/859 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s178 0) (EQ s73 1) (EQ s90 0) (EQ s179 1) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 104 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-06 finished in 981 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(p1))))'
Support contains 3 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 877 transition count 851
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 877 transition count 851
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 873 transition count 847
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 872 transition count 846
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 872 transition count 846
Applied a total of 26 rules in 165 ms. Remains 872 /885 variables (removed 13) and now considering 846/859 (removed 13) transitions.
// Phase 1: matrix 846 rows 872 cols
[2023-03-12 14:29:52] [INFO ] Computed 76 place invariants in 5 ms
[2023-03-12 14:29:53] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-12 14:29:53] [INFO ] Invariant cache hit.
[2023-03-12 14:29:54] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-12 14:29:54] [INFO ] Invariant cache hit.
[2023-03-12 14:29:55] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 872/885 places, 846/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2668 ms. Remains : 872/885 places, 846/859 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s737 0) (EQ s847 1)), p1:(EQ s153 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 570 reset in 422 ms.
Product exploration explored 100000 steps with 641 reset in 473 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 465 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:29:57] [INFO ] Invariant cache hit.
[2023-03-12 14:29:57] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:29:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 61 ms returned sat
[2023-03-12 14:29:57] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 14:29:58] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:29:58] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 14:29:58] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 170 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 823 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 47 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-03-12 14:29:59] [INFO ] Invariant cache hit.
[2023-03-12 14:30:00] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-12 14:30:00] [INFO ] Invariant cache hit.
[2023-03-12 14:30:01] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2023-03-12 14:30:01] [INFO ] Invariant cache hit.
[2023-03-12 14:30:04] [INFO ] Dead Transitions using invariants and state equation in 2792 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4319 ms. Remains : 872/872 places, 846/846 transitions.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/872 stabilizing places and 210/846 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 594 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:30:05] [INFO ] Invariant cache hit.
[2023-03-12 14:30:05] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:30:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 46 ms returned sat
[2023-03-12 14:30:05] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 14:30:06] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:30:06] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-12 14:30:06] [INFO ] After 959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 785 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 620 reset in 306 ms.
Product exploration explored 100000 steps with 615 reset in 314 ms.
Support contains 3 out of 872 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 872/872 places, 846/846 transitions.
Applied a total of 0 rules in 45 ms. Remains 872 /872 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-03-12 14:30:08] [INFO ] Invariant cache hit.
[2023-03-12 14:30:09] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 14:30:09] [INFO ] Invariant cache hit.
[2023-03-12 14:30:09] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-03-12 14:30:09] [INFO ] Invariant cache hit.
[2023-03-12 14:30:10] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1893 ms. Remains : 872/872 places, 846/846 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 18201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 884 transition count 545
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 350 rules applied. Total rules applied 663 place count 571 transition count 508
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 689 place count 547 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 691 place count 545 transition count 506
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 691 place count 545 transition count 401
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 901 place count 440 transition count 401
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 906 place count 435 transition count 396
Iterating global reduction 4 with 5 rules applied. Total rules applied 911 place count 435 transition count 396
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 911 place count 435 transition count 393
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 917 place count 432 transition count 393
Performed 168 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1253 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1254 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1288 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1299 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1299 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1323 place count 217 transition count 178
Applied a total of 1323 rules in 51 ms. Remains 217 /885 variables (removed 668) and now considering 178/859 (removed 681) transitions.
// Phase 1: matrix 178 rows 217 cols
[2023-03-12 14:30:10] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants in 170 ms returned [126, 166, 170, 174, 178, 183, 187, 191, 195, 199, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 171 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/885 places, 178/859 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
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 0 with 4 rules applied. Total rules applied 28 place count 189 transition count 164
Applied a total of 28 rules in 8 ms. Remains 189 /203 variables (removed 14) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 189 cols
[2023-03-12 14:30:11] [INFO ] Computed 39 place invariants in 0 ms
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-12 14:30:11] [INFO ] Invariant cache hit.
[2023-03-12 14:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/885 places, 164/859 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 189/885 places, 164/859 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s137 0) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-09 finished in 698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 885 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 884 transition count 539
Reduce places removed 319 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 356 rules applied. Total rules applied 675 place count 565 transition count 502
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 699 place count 541 transition count 502
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 699 place count 541 transition count 399
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 905 place count 438 transition count 399
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 910 place count 433 transition count 394
Iterating global reduction 3 with 5 rules applied. Total rules applied 915 place count 433 transition count 394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 915 place count 433 transition count 391
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 921 place count 430 transition count 391
Performed 167 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 1255 place count 263 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1256 place count 262 transition count 200
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 24 rules applied. Total rules applied 1280 place count 245 transition count 193
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1287 place count 238 transition count 193
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1287 place count 238 transition count 185
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1303 place count 230 transition count 185
Applied a total of 1303 rules in 52 ms. Remains 230 /885 variables (removed 655) and now considering 185/859 (removed 674) transitions.
// Phase 1: matrix 185 rows 230 cols
[2023-03-12 14:30:11] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-12 14:30:11] [INFO ] Implicit Places using invariants in 142 ms returned [95, 133, 171, 177, 183, 189, 194, 198, 202, 206, 212, 216, 220, 224, 229]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 143 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 215/885 places, 185/859 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 202 transition count 172
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 202 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 201 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 201 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 200 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 200 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 199 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 199 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 198 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 198 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 197 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 197 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 196 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 196 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 195 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 195 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 194 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 194 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 193 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 193 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 192 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 192 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 191 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 191 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 190 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 190 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 189 transition count 159
Applied a total of 52 rules in 75 ms. Remains 189 /215 variables (removed 26) and now considering 159/185 (removed 26) transitions.
// Phase 1: matrix 159 rows 189 cols
[2023-03-12 14:30:11] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 14:30:12] [INFO ] Invariant cache hit.
[2023-03-12 14:30:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants and state equation in 318 ms returned [87, 89, 91]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 657 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 186/885 places, 159/859 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 186 transition count 156
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 183 transition count 156
Applied a total of 6 rules in 33 ms. Remains 183 /186 variables (removed 3) and now considering 156/159 (removed 3) transitions.
// Phase 1: matrix 156 rows 183 cols
[2023-03-12 14:30:12] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-12 14:30:12] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 14:30:12] [INFO ] Invariant cache hit.
[2023-03-12 14:30:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 14:30:13] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 183/885 places, 156/859 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1754 ms. Remains : 183/885 places, 156/859 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s90 1)), p1:(EQ s172 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLCardinality-14 finished in 2017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 878 transition count 852
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 878 transition count 852
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 874 transition count 848
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 873 transition count 847
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 873 transition count 847
Applied a total of 24 rules in 148 ms. Remains 873 /885 variables (removed 12) and now considering 847/859 (removed 12) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:30:13] [INFO ] Computed 76 place invariants in 17 ms
[2023-03-12 14:30:14] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-12 14:30:14] [INFO ] Invariant cache hit.
[2023-03-12 14:30:15] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2023-03-12 14:30:15] [INFO ] Invariant cache hit.
[2023-03-12 14:30:15] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 873/885 places, 847/859 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2034 ms. Remains : 873/885 places, 847/859 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s543 0) (EQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 182 reset in 319 ms.
Product exploration explored 100000 steps with 182 reset in 341 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436388 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436388 steps, saw 99374 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:30:19] [INFO ] Invariant cache hit.
[2023-03-12 14:30:20] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:30:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 80 ms returned sat
[2023-03-12 14:30:20] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:30:21] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:30:21] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 1 ms to minimize.
[2023-03-12 14:30:22] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 1 ms to minimize.
[2023-03-12 14:30:22] [INFO ] Deduced a trap composed of 128 places in 352 ms of which 0 ms to minimize.
[2023-03-12 14:30:22] [INFO ] Deduced a trap composed of 118 places in 243 ms of which 0 ms to minimize.
[2023-03-12 14:30:26] [INFO ] Deduced a trap composed of 149 places in 3729 ms of which 29 ms to minimize.
[2023-03-12 14:30:26] [INFO ] Deduced a trap composed of 118 places in 287 ms of which 1 ms to minimize.
[2023-03-12 14:30:28] [INFO ] Deduced a trap composed of 149 places in 1652 ms of which 2 ms to minimize.
[2023-03-12 14:30:29] [INFO ] Deduced a trap composed of 118 places in 426 ms of which 1 ms to minimize.
[2023-03-12 14:30:29] [INFO ] Deduced a trap composed of 149 places in 479 ms of which 26 ms to minimize.
[2023-03-12 14:30:30] [INFO ] Deduced a trap composed of 118 places in 489 ms of which 1 ms to minimize.
[2023-03-12 14:30:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8788 ms
[2023-03-12 14:30:30] [INFO ] After 9735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 14:30:30] [INFO ] After 10123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 873 transition count 536
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 658 place count 562 transition count 500
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 683 place count 538 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 684 place count 537 transition count 499
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 684 place count 537 transition count 396
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 890 place count 434 transition count 396
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1232 place count 263 transition count 201
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1280 place count 263 transition count 153
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1328 place count 215 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1329 place count 214 transition count 152
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 5 with 63 rules applied. Total rules applied 1392 place count 181 transition count 122
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 31 rules applied. Total rules applied 1423 place count 151 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1424 place count 150 transition count 121
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1424 place count 150 transition count 104
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1458 place count 133 transition count 104
Applied a total of 1458 rules in 49 ms. Remains 133 /873 variables (removed 740) and now considering 104/847 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 133/873 places, 104/847 transitions.
Finished random walk after 153 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 44 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-12 14:30:31] [INFO ] Invariant cache hit.
[2023-03-12 14:30:31] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-12 14:30:31] [INFO ] Invariant cache hit.
[2023-03-12 14:30:32] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2023-03-12 14:30:32] [INFO ] Invariant cache hit.
[2023-03-12 14:30:33] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2235 ms. Remains : 873/873 places, 847/847 transitions.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470315 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470315 steps, saw 105099 distinct states, run finished after 3013 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:30:36] [INFO ] Invariant cache hit.
[2023-03-12 14:30:36] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:30:37] [INFO ] [Nat]Absence check using 75 positive place invariants in 48 ms returned sat
[2023-03-12 14:30:37] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 14:30:37] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:30:38] [INFO ] Deduced a trap composed of 21 places in 540 ms of which 1 ms to minimize.
[2023-03-12 14:30:39] [INFO ] Deduced a trap composed of 23 places in 928 ms of which 14 ms to minimize.
[2023-03-12 14:30:39] [INFO ] Deduced a trap composed of 128 places in 472 ms of which 1 ms to minimize.
[2023-03-12 14:30:41] [INFO ] Deduced a trap composed of 118 places in 1085 ms of which 1 ms to minimize.
[2023-03-12 14:30:41] [INFO ] Deduced a trap composed of 149 places in 405 ms of which 1 ms to minimize.
[2023-03-12 14:30:42] [INFO ] Deduced a trap composed of 118 places in 560 ms of which 0 ms to minimize.
[2023-03-12 14:30:43] [INFO ] Deduced a trap composed of 149 places in 935 ms of which 1 ms to minimize.
[2023-03-12 14:30:43] [INFO ] Deduced a trap composed of 118 places in 336 ms of which 1 ms to minimize.
[2023-03-12 14:30:44] [INFO ] Deduced a trap composed of 149 places in 509 ms of which 0 ms to minimize.
[2023-03-12 14:30:44] [INFO ] Deduced a trap composed of 118 places in 415 ms of which 1 ms to minimize.
[2023-03-12 14:30:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6789 ms
[2023-03-12 14:30:44] [INFO ] After 7468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 14:30:44] [INFO ] After 7832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 847/847 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 873 transition count 536
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 658 place count 562 transition count 500
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 683 place count 538 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 684 place count 537 transition count 499
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 684 place count 537 transition count 396
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 890 place count 434 transition count 396
Performed 171 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1232 place count 263 transition count 201
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1280 place count 263 transition count 153
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1328 place count 215 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1329 place count 214 transition count 152
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 5 with 63 rules applied. Total rules applied 1392 place count 181 transition count 122
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 31 rules applied. Total rules applied 1423 place count 151 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1424 place count 150 transition count 121
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1424 place count 150 transition count 104
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1458 place count 133 transition count 104
Applied a total of 1458 rules in 51 ms. Remains 133 /873 variables (removed 740) and now considering 104/847 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 133/873 places, 104/847 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 182 reset in 248 ms.
Product exploration explored 100000 steps with 182 reset in 230 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 873 transition count 847
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 300 place count 873 transition count 835
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 300 place count 873 transition count 835
Deduced a syphon composed of 402 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 414 place count 873 transition count 835
Discarding 236 places :
Symmetric choice reduction at 2 with 236 rule applications. Total rules 650 place count 637 transition count 599
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 2 with 236 rules applied. Total rules applied 886 place count 637 transition count 599
Performed 208 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 2 with 208 rules applied. Total rules applied 1094 place count 637 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 1228 place count 503 transition count 441
Deduced a syphon composed of 240 places in 0 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 1362 place count 503 transition count 441
Deduced a syphon composed of 240 places in 0 ms
Applied a total of 1362 rules in 162 ms. Remains 503 /873 variables (removed 370) and now considering 441/847 (removed 406) transitions.
[2023-03-12 14:30:46] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 441 rows 503 cols
[2023-03-12 14:30:46] [INFO ] Computed 76 place invariants in 5 ms
[2023-03-12 14:30:47] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/873 places, 441/847 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 503/873 places, 441/847 transitions.
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Applied a total of 0 rules in 21 ms. Remains 873 /873 variables (removed 0) and now considering 847/847 (removed 0) transitions.
// Phase 1: matrix 847 rows 873 cols
[2023-03-12 14:30:47] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-12 14:30:47] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-12 14:30:47] [INFO ] Invariant cache hit.
[2023-03-12 14:30:48] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2023-03-12 14:30:48] [INFO ] Invariant cache hit.
[2023-03-12 14:30:49] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1958 ms. Remains : 873/873 places, 847/847 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 35513 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(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLCardinality-08
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 885 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 884 transition count 547
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 348 rules applied. Total rules applied 659 place count 573 transition count 510
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 685 place count 549 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 687 place count 547 transition count 508
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 106 Pre rules applied. Total rules applied 687 place count 547 transition count 402
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 899 place count 441 transition count 402
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 904 place count 436 transition count 397
Iterating global reduction 4 with 5 rules applied. Total rules applied 909 place count 436 transition count 397
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 909 place count 436 transition count 394
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 915 place count 433 transition count 394
Performed 167 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1249 place count 266 transition count 204
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1250 place count 265 transition count 203
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1284 place count 242 transition count 192
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1295 place count 231 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1295 place count 231 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1319 place count 219 transition count 180
Applied a total of 1319 rules in 70 ms. Remains 219 /885 variables (removed 666) and now considering 180/859 (removed 679) transitions.
// Phase 1: matrix 180 rows 219 cols
[2023-03-12 14:30:49] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-12 14:30:49] [INFO ] Implicit Places using invariants in 181 ms returned [88, 126, 164, 168, 172, 183, 187, 191, 195, 199, 203, 213, 218]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 182 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 206/885 places, 180/859 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 169
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 194 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 194 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 193 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 193 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 192 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 192 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 191 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 191 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 190 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 190 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 189 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 189 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 188 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 188 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 187 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 187 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 186 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 186 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 185 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 185 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 184 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 184 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 183 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 183 transition count 157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 180 transition count 154
Applied a total of 52 rules in 32 ms. Remains 180 /206 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 180 cols
[2023-03-12 14:30:49] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-12 14:30:49] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-12 14:30:49] [INFO ] Invariant cache hit.
[2023-03-12 14:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:30:50] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 180/885 places, 154/859 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 772 ms. Remains : 180/885 places, 154/859 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s159 0) (EQ s176 1)), p1:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4227 reset in 348 ms.
Product exploration explored 100000 steps with 4355 reset in 376 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/180 stabilizing places and 5/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 693 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 625 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 14:30:52] [INFO ] Invariant cache hit.
[2023-03-12 14:30:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-12 14:30:53] [INFO ] Invariant cache hit.
[2023-03-12 14:30:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:30:53] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-12 14:30:53] [INFO ] Invariant cache hit.
[2023-03-12 14:30:53] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 180/180 places, 154/154 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/180 stabilizing places and 5/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 951 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 111 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 738 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4356 reset in 265 ms.
Product exploration explored 100000 steps with 4257 reset in 329 ms.
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 180 /180 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 14:30:57] [INFO ] Invariant cache hit.
[2023-03-12 14:30:57] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-12 14:30:57] [INFO ] Invariant cache hit.
[2023-03-12 14:30:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:30:57] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-12 14:30:57] [INFO ] Invariant cache hit.
[2023-03-12 14:30:57] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 180/180 places, 154/154 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-08 finished in 8594 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)))'
Found a Lengthening insensitive property : AutoFlight-PT-12b-LTLCardinality-15
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 885 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 885/885 places, 859/859 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 884 transition count 542
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 353 rules applied. Total rules applied 669 place count 568 transition count 505
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 694 place count 544 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 543 transition count 504
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 695 place count 543 transition count 400
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 903 place count 439 transition count 400
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 907 place count 435 transition count 396
Iterating global reduction 4 with 4 rules applied. Total rules applied 911 place count 435 transition count 396
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 911 place count 435 transition count 393
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 917 place count 432 transition count 393
Performed 168 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1253 place count 264 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1254 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1288 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1299 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1299 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1323 place count 217 transition count 178
Applied a total of 1323 rules in 78 ms. Remains 217 /885 variables (removed 668) and now considering 178/859 (removed 681) transitions.
// Phase 1: matrix 178 rows 217 cols
[2023-03-12 14:30:58] [INFO ] Computed 53 place invariants in 3 ms
[2023-03-12 14:30:58] [INFO ] Implicit Places using invariants in 452 ms returned [88, 128, 166, 170, 174, 178, 183, 187, 191, 195, 199, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 453 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 202/885 places, 178/859 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 188 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 178 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 177 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 177 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 176 transition count 152
Applied a total of 52 rules in 27 ms. Remains 176 /202 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 176 cols
[2023-03-12 14:30:58] [INFO ] Computed 38 place invariants in 0 ms
[2023-03-12 14:30:58] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 14:30:58] [INFO ] Invariant cache hit.
[2023-03-12 14:30:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 14:30:59] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 176/885 places, 152/859 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1388 ms. Remains : 176/885 places, 152/859 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s100 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2218 reset in 245 ms.
Product exploration explored 100000 steps with 2237 reset in 248 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1926669 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :{}
Probabilistic random walk after 1926669 steps, saw 225000 distinct states, run finished after 3016 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:31:03] [INFO ] Invariant cache hit.
[2023-03-12 14:31:03] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:31:03] [INFO ] [Nat]Absence check using 38 positive place invariants in 8 ms returned sat
[2023-03-12 14:31:03] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:31:03] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 14:31:03] [INFO ] After 10ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:31:03] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2023-03-12 14:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-12 14:31:03] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 14:31:03] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 152/152 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 176 transition count 90
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t471.t467.t787.t468.t466.t56.t245.t838.t57 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 19 edges and 104 vertex of which 3 / 104 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 75 place count 102 transition count 78
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 89 place count 92 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 89 place count 92 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 89 transition count 71
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 89 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 87 transition count 69
Applied a total of 99 rules in 26 ms. Remains 87 /176 variables (removed 89) and now considering 69/152 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 87/176 places, 69/152 transitions.
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-12 14:31:04] [INFO ] Invariant cache hit.
[2023-03-12 14:31:04] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-12 14:31:04] [INFO ] Invariant cache hit.
[2023-03-12 14:31:04] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 14:31:05] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-12 14:31:05] [INFO ] Invariant cache hit.
[2023-03-12 14:31:05] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1062 ms. Remains : 176/176 places, 152/152 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1960623 steps, run timeout after 3001 ms. (steps per millisecond=653 ) properties seen :{}
Probabilistic random walk after 1960623 steps, saw 228494 distinct states, run finished after 3001 ms. (steps per millisecond=653 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:31:09] [INFO ] Invariant cache hit.
[2023-03-12 14:31:09] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:31:09] [INFO ] [Nat]Absence check using 38 positive place invariants in 20 ms returned sat
[2023-03-12 14:31:09] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:31:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 14:31:09] [INFO ] After 21ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:31:09] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 1 ms to minimize.
[2023-03-12 14:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-12 14:31:09] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 14:31:09] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2203 reset in 245 ms.
Product exploration explored 100000 steps with 2210 reset in 276 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 152/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-12 14:31:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 14:31:11] [INFO ] Invariant cache hit.
[2023-03-12 14:31:12] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 744 ms. Remains : 176/176 places, 152/152 transitions.
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 152/152 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2023-03-12 14:31:12] [INFO ] Invariant cache hit.
[2023-03-12 14:31:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 14:31:12] [INFO ] Invariant cache hit.
[2023-03-12 14:31:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 14:31:12] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-12 14:31:12] [INFO ] Invariant cache hit.
[2023-03-12 14:31:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 176/176 places, 152/152 transitions.
Treatment of property AutoFlight-PT-12b-LTLCardinality-15 finished in 15150 ms.
[2023-03-12 14:31:12] [INFO ] Flatten gal took : 59 ms
[2023-03-12 14:31:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 14:31:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 885 places, 859 transitions and 2088 arcs took 22 ms.
Total runtime 108982 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1722/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-12b-LTLCardinality-08
Could not compute solution for formula : AutoFlight-PT-12b-LTLCardinality-15

BK_STOP 1678631474341

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-12b-LTLCardinality-08
ltl formula formula --ltl=/tmp/1722/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 885 places, 859 transitions and 2088 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.180 real 0.080 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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 AutoFlight-PT-12b-LTLCardinality-15
ltl formula formula --ltl=/tmp/1722/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 885 places, 859 transitions and 2088 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.230 real 0.060 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1722/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="LTLCardinality"
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 AutoFlight-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598000475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;