About the Execution of LTSMin+red for AutoFlight-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 527.691 | 26957.00 | 56284.00 | 93.90 | FT?FTFTFFFFFF?FF | normal |
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-167813597900411.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-03b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900411
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 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.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 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 70K 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-03b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678627444716
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-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:24:08] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-12 13:24:08] [INFO ] Transformed 298 places.
[2023-03-12 13:24:08] [INFO ] Transformed 296 transitions.
[2023-03-12 13:24:08] [INFO ] Found NUPN structural information;
[2023-03-12 13:24:08] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-03b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 265 transition count 263
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 265 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 265 transition count 258
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 251 transition count 244
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 251 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 248 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 248 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 247 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 247 transition count 240
Applied a total of 107 rules in 85 ms. Remains 247 /298 variables (removed 51) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 247 cols
[2023-03-12 13:24:08] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-12 13:24:09] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-12 13:24:09] [INFO ] Invariant cache hit.
[2023-03-12 13:24:09] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-12 13:24:09] [INFO ] Invariant cache hit.
[2023-03-12 13:24:09] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 247/298 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 247/298 places, 240/296 transitions.
Support contains 27 out of 247 places after structural reductions.
[2023-03-12 13:24:10] [INFO ] Flatten gal took : 42 ms
[2023-03-12 13:24:10] [INFO ] Flatten gal took : 16 ms
[2023-03-12 13:24:10] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:24:10] [INFO ] Invariant cache hit.
[2023-03-12 13:24:10] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:24:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-12 13:24:11] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-12 13:24:11] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 13:24:11] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 17 ms to minimize.
[2023-03-12 13:24:12] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 4 ms to minimize.
[2023-03-12 13:24:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2023-03-12 13:24:12] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 6 ms to minimize.
[2023-03-12 13:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-12 13:24:12] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 13:24:12] [INFO ] After 1436ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 24 ms.
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 240/240 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 247 transition count 164
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 87 rules applied. Total rules applied 163 place count 171 transition count 153
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 171 place count 165 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 173 place count 163 transition count 151
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 173 place count 163 transition count 119
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 237 place count 131 transition count 119
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 245 place count 123 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 253 place count 123 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 253 place count 123 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 261 place count 119 transition count 107
Performed 43 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 347 place count 76 transition count 59
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 359 place count 76 transition count 47
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 371 place count 64 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 372 place count 63 transition count 46
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 5 with 33 rules applied. Total rules applied 405 place count 49 transition count 27
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 20 rules applied. Total rules applied 425 place count 30 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 426 place count 29 transition count 26
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 426 place count 29 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 438 place count 23 transition count 20
Applied a total of 438 rules in 44 ms. Remains 23 /247 variables (removed 224) and now considering 20/240 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 23/247 places, 20/240 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
FORMULA AutoFlight-PT-03b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA AutoFlight-PT-03b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 64 stabilizing places and 64 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' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 246 transition count 160
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 90 rules applied. Total rules applied 169 place count 167 transition count 149
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 176 place count 161 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 160 transition count 148
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 177 place count 160 transition count 116
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 241 place count 128 transition count 116
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 248 place count 121 transition count 109
Iterating global reduction 4 with 7 rules applied. Total rules applied 255 place count 121 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 255 place count 121 transition count 106
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 261 place count 118 transition count 106
Performed 44 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 349 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 350 place count 73 transition count 56
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 359 place count 67 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 362 place count 64 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 362 place count 64 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 368 place count 61 transition count 50
Applied a total of 368 rules in 44 ms. Remains 61 /247 variables (removed 186) and now considering 50/240 (removed 190) transitions.
// Phase 1: matrix 50 rows 61 cols
[2023-03-12 13:24:12] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 13:24:12] [INFO ] Implicit Places using invariants in 112 ms returned [23, 47, 51, 55, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/247 places, 50/240 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 47
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 10 place count 51 transition count 45
Applied a total of 10 rules in 2 ms. Remains 51 /56 variables (removed 5) and now considering 45/50 (removed 5) transitions.
// Phase 1: matrix 45 rows 51 cols
[2023-03-12 13:24:12] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 13:24:13] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 13:24:13] [INFO ] Invariant cache hit.
[2023-03-12 13:24:13] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/247 places, 45/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 51/247 places, 45/240 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-00 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s20 1)), p1:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 29 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-00 finished in 830 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(F(p0))||G(p1))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 239 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 239 transition count 232
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 235 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 235 transition count 228
Applied a total of 24 rules in 38 ms. Remains 235 /247 variables (removed 12) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 235 cols
[2023-03-12 13:24:13] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:24:13] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 13:24:13] [INFO ] Invariant cache hit.
[2023-03-12 13:24:14] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-12 13:24:14] [INFO ] Invariant cache hit.
[2023-03-12 13:24:14] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/247 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 235/247 places, 228/240 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s75 1), p0:(OR (EQ s37 0) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 626 reset in 277 ms.
Product exploration explored 100000 steps with 627 reset in 270 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 433 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 63 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9135 steps, run visited all 1 properties in 40 ms. (steps per millisecond=228 )
Probabilistic random walk after 9135 steps, saw 3354 distinct states, run finished after 40 ms. (steps per millisecond=228 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 415 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 228/228 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 234 transition count 151
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 85 rules applied. Total rules applied 161 place count 158 transition count 142
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 168 place count 152 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 151 transition count 141
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 169 place count 151 transition count 110
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 231 place count 120 transition count 110
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 323 place count 74 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 73 transition count 57
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 333 place count 67 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 336 place count 64 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 336 place count 64 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 342 place count 61 transition count 51
Applied a total of 342 rules in 29 ms. Remains 61 /235 variables (removed 174) and now considering 51/228 (removed 177) transitions.
// Phase 1: matrix 51 rows 61 cols
[2023-03-12 13:24:16] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 13:24:16] [INFO ] Implicit Places using invariants in 40 ms returned [23, 36, 47, 51, 55, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/235 places, 51/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 47
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 10 place count 50 transition count 46
Applied a total of 10 rules in 3 ms. Remains 50 /55 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-12 13:24:16] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 13:24:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 13:24:16] [INFO ] Invariant cache hit.
[2023-03-12 13:24:16] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/235 places, 46/228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 50/235 places, 46/228 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 659 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24220 steps, run visited all 1 properties in 39 ms. (steps per millisecond=621 )
Probabilistic random walk after 24220 steps, saw 5791 distinct states, run finished after 52 ms. (steps per millisecond=465 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6509 reset in 141 ms.
Product exploration explored 100000 steps with 6506 reset in 181 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 46/46 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 49 transition count 44
Applied a total of 3 rules in 2 ms. Remains 49 /50 variables (removed 1) and now considering 44/46 (removed 2) transitions.
// Phase 1: matrix 44 rows 49 cols
[2023-03-12 13:24:17] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 13:24:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 13:24:17] [INFO ] Invariant cache hit.
[2023-03-12 13:24:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-12 13:24:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:24:17] [INFO ] Invariant cache hit.
[2023-03-12 13:24:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/50 places, 44/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 49/50 places, 44/46 transitions.
Treatment of property AutoFlight-PT-03b-LTLCardinality-02 finished in 4399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 238 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 238 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 234 transition count 226
Applied a total of 27 rules in 36 ms. Remains 234 /247 variables (removed 13) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2023-03-12 13:24:17] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:24:18] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 13:24:18] [INFO ] Invariant cache hit.
[2023-03-12 13:24:18] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-12 13:24:18] [INFO ] Invariant cache hit.
[2023-03-12 13:24:18] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/247 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 234/247 places, 226/240 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s31 0) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-06 finished in 1425 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 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 246 transition count 161
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 168 transition count 150
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 174 place count 162 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 161 transition count 149
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 175 place count 161 transition count 117
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 239 place count 129 transition count 117
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 248 place count 120 transition count 108
Iterating global reduction 4 with 9 rules applied. Total rules applied 257 place count 120 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 257 place count 120 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 265 place count 116 transition count 104
Performed 43 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 351 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 352 place count 72 transition count 55
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 361 place count 66 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 364 place count 63 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 364 place count 63 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 370 place count 60 transition count 49
Applied a total of 370 rules in 16 ms. Remains 60 /247 variables (removed 187) and now considering 49/240 (removed 191) transitions.
// Phase 1: matrix 49 rows 60 cols
[2023-03-12 13:24:19] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants in 50 ms returned [21, 33, 50, 54, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 55 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/247 places, 49/240 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 52 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 52 transition count 46
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 2 with 4 rules applied. Total rules applied 10 place count 50 transition count 44
Applied a total of 10 rules in 3 ms. Remains 50 /55 variables (removed 5) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 50 cols
[2023-03-12 13:24:19] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 13:24:19] [INFO ] Invariant cache hit.
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/247 places, 44/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 50/247 places, 44/240 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-07 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 s44 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-07 finished in 331 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 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 246 transition count 160
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 90 rules applied. Total rules applied 169 place count 167 transition count 149
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 175 place count 161 transition count 149
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 175 place count 161 transition count 116
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 241 place count 128 transition count 116
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 248 place count 121 transition count 109
Iterating global reduction 3 with 7 rules applied. Total rules applied 255 place count 121 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 255 place count 121 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 259 place count 119 transition count 107
Performed 46 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 351 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 72 transition count 55
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 361 place count 66 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 364 place count 63 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 364 place count 63 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 370 place count 60 transition count 49
Applied a total of 370 rules in 38 ms. Remains 60 /247 variables (removed 187) and now considering 49/240 (removed 191) transitions.
// Phase 1: matrix 49 rows 60 cols
[2023-03-12 13:24:19] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants in 88 ms returned [24, 35, 46, 50, 54, 59]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/247 places, 49/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 43
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 14 place count 47 transition count 42
Applied a total of 14 rules in 5 ms. Remains 47 /54 variables (removed 7) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 47 cols
[2023-03-12 13:24:19] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 13:24:19] [INFO ] Invariant cache hit.
[2023-03-12 13:24:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/247 places, 42/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 47/247 places, 42/240 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-12 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 (NEQ s6 0) (NEQ s21 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 10 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-12 finished in 380 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(F(p0))||G(p1))))'
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 246 transition count 161
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 167 place count 168 transition count 150
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 174 place count 162 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 161 transition count 149
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 175 place count 161 transition count 117
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 239 place count 129 transition count 117
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 247 place count 121 transition count 109
Iterating global reduction 4 with 8 rules applied. Total rules applied 255 place count 121 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 255 place count 121 transition count 106
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 261 place count 118 transition count 106
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 343 place count 77 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 344 place count 77 transition count 60
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 4 with 2 rules applied. Total rules applied 346 place count 76 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 347 place count 75 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 354 place count 70 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 356 place count 68 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 356 place count 68 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 362 place count 65 transition count 53
Applied a total of 362 rules in 16 ms. Remains 65 /247 variables (removed 182) and now considering 53/240 (removed 187) transitions.
// Phase 1: matrix 53 rows 65 cols
[2023-03-12 13:24:20] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-12 13:24:20] [INFO ] Implicit Places using invariants in 88 ms returned [59, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/247 places, 53/240 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 58 transition count 48
Applied a total of 10 rules in 2 ms. Remains 58 /63 variables (removed 5) and now considering 48/53 (removed 5) transitions.
// Phase 1: matrix 48 rows 58 cols
[2023-03-12 13:24:20] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-12 13:24:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 13:24:20] [INFO ] Invariant cache hit.
[2023-03-12 13:24:20] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/247 places, 48/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 58/247 places, 48/240 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s25 0) (EQ s50 1)), p0:(AND (EQ s50 0) (EQ s25 1) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5642 reset in 156 ms.
Product exploration explored 100000 steps with 5617 reset in 187 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 369 steps, including 20 resets, run visited all 2 properties in 8 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-12 13:24:21] [INFO ] Invariant cache hit.
[2023-03-12 13:24:21] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-12 13:24:21] [INFO ] Invariant cache hit.
[2023-03-12 13:24:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-12 13:24:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:24:22] [INFO ] Invariant cache hit.
[2023-03-12 13:24:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 58/58 places, 48/48 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 175 steps, including 9 resets, run visited all 2 properties in 2 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 459 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5607 reset in 141 ms.
Product exploration explored 100000 steps with 5634 reset in 261 ms.
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-12 13:24:23] [INFO ] Invariant cache hit.
[2023-03-12 13:24:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 13:24:23] [INFO ] Invariant cache hit.
[2023-03-12 13:24:23] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-12 13:24:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:24:23] [INFO ] Invariant cache hit.
[2023-03-12 13:24:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 58/58 places, 48/48 transitions.
Treatment of property AutoFlight-PT-03b-LTLCardinality-13 finished in 3990 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)&&F(p1))))'
Support contains 5 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 238 transition count 231
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 238 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 234 transition count 226
Applied a total of 27 rules in 10 ms. Remains 234 /247 variables (removed 13) and now considering 226/240 (removed 14) transitions.
// Phase 1: matrix 226 rows 234 cols
[2023-03-12 13:24:24] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:24:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 13:24:24] [INFO ] Invariant cache hit.
[2023-03-12 13:24:24] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-12 13:24:24] [INFO ] Invariant cache hit.
[2023-03-12 13:24:24] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/247 places, 226/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 234/247 places, 226/240 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s165 1), p1:(OR (EQ s17 0) (EQ s231 1) (EQ s158 0) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-15 finished in 536 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(F(p0))||G(p1))))'
Found a Lengthening insensitive property : AutoFlight-PT-03b-LTLCardinality-02
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 247 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 247/247 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 246 transition count 162
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 87 rules applied. Total rules applied 164 place count 169 transition count 152
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 171 place count 163 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 162 transition count 151
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 172 place count 162 transition count 119
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 236 place count 130 transition count 119
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 244 place count 122 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 252 place count 122 transition count 111
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 252 place count 122 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 260 place count 118 transition count 107
Performed 44 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 348 place count 74 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 349 place count 73 transition count 57
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 358 place count 67 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 361 place count 64 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 361 place count 64 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 367 place count 61 transition count 51
Applied a total of 367 rules in 16 ms. Remains 61 /247 variables (removed 186) and now considering 51/240 (removed 189) transitions.
// Phase 1: matrix 51 rows 61 cols
[2023-03-12 13:24:24] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 13:24:25] [INFO ] Implicit Places using invariants in 46 ms returned [23, 36, 47, 51, 55, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 48 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 55/247 places, 51/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 51 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 51 transition count 47
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 10 place count 50 transition count 46
Applied a total of 10 rules in 2 ms. Remains 50 /55 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 50 cols
[2023-03-12 13:24:25] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 13:24:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 13:24:25] [INFO ] Invariant cache hit.
[2023-03-12 13:24:25] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 50/247 places, 46/240 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 176 ms. Remains : 50/247 places, 46/240 transitions.
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s19 1), p0:(OR (EQ s6 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6541 reset in 139 ms.
Product exploration explored 100000 steps with 6503 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 637 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:24:26] [INFO ] Invariant cache hit.
[2023-03-12 13:24:26] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:24:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-12 13:24:26] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:24:26] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 13:24:26] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:24:27] [INFO ] Invariant cache hit.
[2023-03-12 13:24:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 13:24:27] [INFO ] Invariant cache hit.
[2023-03-12 13:24:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-12 13:24:27] [INFO ] Invariant cache hit.
[2023-03-12 13:24:27] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 50/50 places, 46/46 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 655 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:24:28] [INFO ] Invariant cache hit.
[2023-03-12 13:24:28] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:24:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 13:24:28] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:24:28] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 13:24:28] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 599 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6525 reset in 128 ms.
Product exploration explored 100000 steps with 6505 reset in 140 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:24:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:24:30] [INFO ] Invariant cache hit.
[2023-03-12 13:24:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 50/50 places, 46/46 transitions.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:24:30] [INFO ] Invariant cache hit.
[2023-03-12 13:24:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 13:24:30] [INFO ] Invariant cache hit.
[2023-03-12 13:24:30] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 13:24:30] [INFO ] Invariant cache hit.
[2023-03-12 13:24:30] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 50/50 places, 46/46 transitions.
Treatment of property AutoFlight-PT-03b-LTLCardinality-02 finished in 6022 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(F(p0))||G(p1))))'
[2023-03-12 13:24:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 13:24:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 13:24:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 247 places, 240 transitions and 580 arcs took 14 ms.
Total runtime 22850 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1313/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1313/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-03b-LTLCardinality-02
Could not compute solution for formula : AutoFlight-PT-03b-LTLCardinality-13
BK_STOP 1678627471673
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-03b-LTLCardinality-02
ltl formula formula --ltl=/tmp/1313/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 247 places, 240 transitions and 580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.000 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1313/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1313/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1313/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1313/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutoFlight-PT-03b-LTLCardinality-13
ltl formula formula --ltl=/tmp/1313/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
pnml2lts-mc( 0/ 4): Petri net has 247 places, 240 transitions and 580 arcs
Warning: program compiled against libxml 210 using older 209
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.040 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1313/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1313/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1313/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1313/ltl_1_
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:
corrupted size vs. prev_size in fastbins
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-03b"
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-03b, 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-167813597900411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b 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 '
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 ;