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-167813597900427.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-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K 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-04b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678627838518

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-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:30:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:30:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:30:41] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-12 13:30:41] [INFO ] Transformed 390 places.
[2023-03-12 13:30:41] [INFO ] Transformed 388 transitions.
[2023-03-12 13:30:41] [INFO ] Found NUPN structural information;
[2023-03-12 13:30:41] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-04b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 342 transition count 340
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 342 transition count 340
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 342 transition count 333
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 125 place count 320 transition count 311
Iterating global reduction 1 with 22 rules applied. Total rules applied 147 place count 320 transition count 311
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 317 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 317 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 315 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 315 transition count 306
Applied a total of 157 rules in 111 ms. Remains 315 /390 variables (removed 75) and now considering 306/388 (removed 82) transitions.
// Phase 1: matrix 306 rows 315 cols
[2023-03-12 13:30:41] [INFO ] Computed 28 place invariants in 9 ms
[2023-03-12 13:30:42] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-12 13:30:42] [INFO ] Invariant cache hit.
[2023-03-12 13:30:42] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-12 13:30:42] [INFO ] Invariant cache hit.
[2023-03-12 13:30:42] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/390 places, 306/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 315/390 places, 306/388 transitions.
Support contains 23 out of 315 places after structural reductions.
[2023-03-12 13:30:43] [INFO ] Flatten gal took : 47 ms
[2023-03-12 13:30:43] [INFO ] Flatten gal took : 18 ms
[2023-03-12 13:30:43] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 22 out of 315 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 13:30:43] [INFO ] Invariant cache hit.
[2023-03-12 13:30:44] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2023-03-12 13:30:44] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 13:30:44] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 13:30:44] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 14 ms to minimize.
[2023-03-12 13:30:44] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2023-03-12 13:30:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2023-03-12 13:30:44] [INFO ] After 625ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:30:44] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:30:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-12 13:30:44] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 13:30:45] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:30:45] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2023-03-12 13:30:45] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2023-03-12 13:30:45] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-12 13:30:45] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2023-03-12 13:30:45] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2023-03-12 13:30:46] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 26 ms to minimize.
[2023-03-12 13:30:46] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2023-03-12 13:30:46] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2023-03-12 13:30:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1119 ms
[2023-03-12 13:30:46] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2023-03-12 13:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-12 13:30:46] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 13:30:46] [INFO ] After 1719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 197 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 12 ms.
Computed a total of 81 stabilizing places and 81 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)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 314 transition count 195
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 125 rules applied. Total rules applied 235 place count 204 transition count 180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 243 place count 196 transition count 180
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 243 place count 196 transition count 141
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 321 place count 157 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 328 place count 150 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 335 place count 150 transition count 134
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 335 place count 150 transition count 130
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 343 place count 146 transition count 130
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 453 place count 91 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 454 place count 90 transition count 68
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 466 place count 82 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 470 place count 78 transition count 64
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 470 place count 78 transition count 60
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 478 place count 74 transition count 60
Applied a total of 478 rules in 86 ms. Remains 74 /315 variables (removed 241) and now considering 60/306 (removed 246) transitions.
// Phase 1: matrix 60 rows 74 cols
[2023-03-12 13:30:46] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 13:30:47] [INFO ] Implicit Places using invariants in 174 ms returned [28, 42, 56, 60, 64, 68, 73]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/315 places, 60/306 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 55
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 60 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 60 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 59 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 59 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 58 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 58 transition count 51
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 20 place count 57 transition count 50
Applied a total of 20 rules in 12 ms. Remains 57 /67 variables (removed 10) and now considering 50/60 (removed 10) transitions.
// Phase 1: matrix 50 rows 57 cols
[2023-03-12 13:30:47] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 13:30:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 13:30:47] [INFO ] Invariant cache hit.
[2023-03-12 13:30:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/315 places, 50/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 57/315 places, 50/306 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-03 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:(OR (EQ s27 0) (EQ s50 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 76 steps with 4 reset in 5 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 309 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 309 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 309 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 308 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Applied a total of 19 rules in 49 ms. Remains 306 /315 variables (removed 9) and now considering 296/306 (removed 10) transitions.
// Phase 1: matrix 296 rows 306 cols
[2023-03-12 13:30:47] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:30:47] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-12 13:30:47] [INFO ] Invariant cache hit.
[2023-03-12 13:30:48] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-12 13:30:48] [INFO ] Invariant cache hit.
[2023-03-12 13:30:48] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/315 places, 296/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 306/315 places, 296/306 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s38 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9431 steps with 45 reset in 50 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-04 finished in 1018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 308 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 308 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 305 transition count 295
Applied a total of 21 rules in 32 ms. Remains 305 /315 variables (removed 10) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:30:48] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:30:48] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 13:30:48] [INFO ] Invariant cache hit.
[2023-03-12 13:30:48] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-12 13:30:48] [INFO ] Invariant cache hit.
[2023-03-12 13:30:49] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/315 places, 295/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 305/315 places, 295/306 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-05 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 314 transition count 203
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 116 rules applied. Total rules applied 218 place count 212 transition count 189
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 227 place count 204 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 228 place count 203 transition count 188
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 228 place count 203 transition count 147
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 310 place count 162 transition count 147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 316 place count 156 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 322 place count 156 transition count 141
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 322 place count 156 transition count 138
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 328 place count 153 transition count 138
Performed 55 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 438 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 439 place count 97 transition count 76
Reduce places removed 7 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 10 rules applied. Total rules applied 449 place count 90 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 452 place count 87 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 452 place count 87 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 460 place count 83 transition count 69
Applied a total of 460 rules in 38 ms. Remains 83 /315 variables (removed 232) and now considering 69/306 (removed 237) transitions.
// Phase 1: matrix 69 rows 83 cols
[2023-03-12 13:30:49] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-12 13:30:49] [INFO ] Implicit Places using invariants in 97 ms returned [34, 48, 69, 73, 77, 82]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 98 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/315 places, 69/306 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 73 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 72 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 71 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 71 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 70 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 70 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 69 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 69 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 67 transition count 59
Applied a total of 20 rules in 12 ms. Remains 67 /77 variables (removed 10) and now considering 59/69 (removed 10) transitions.
// Phase 1: matrix 59 rows 67 cols
[2023-03-12 13:30:49] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 13:30:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-12 13:30:49] [INFO ] Invariant cache hit.
[2023-03-12 13:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:30:49] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/315 places, 59/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 301 ms. Remains : 67/315 places, 59/306 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-06 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s59 1)), p1:(OR (EQ s33 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5077 reset in 281 ms.
Stack based approach found an accepted trace after 44592 steps with 2224 reset with depth 16 and stack size 16 in 84 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-06 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 308 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 308 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 305 transition count 295
Applied a total of 21 rules in 62 ms. Remains 305 /315 variables (removed 10) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:30:50] [INFO ] Computed 28 place invariants in 24 ms
[2023-03-12 13:30:50] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-12 13:30:50] [INFO ] Invariant cache hit.
[2023-03-12 13:30:50] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-12 13:30:50] [INFO ] Invariant cache hit.
[2023-03-12 13:30:51] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/315 places, 295/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 889 ms. Remains : 305/315 places, 295/306 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-08 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s249 0) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-04b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04b-LTLCardinality-08 finished in 1752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 309 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 309 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 309 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 308 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Applied a total of 19 rules in 28 ms. Remains 306 /315 variables (removed 9) and now considering 296/306 (removed 10) transitions.
// Phase 1: matrix 296 rows 306 cols
[2023-03-12 13:30:52] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-12 13:30:52] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 13:30:52] [INFO ] Invariant cache hit.
[2023-03-12 13:30:52] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-12 13:30:52] [INFO ] Invariant cache hit.
[2023-03-12 13:30:52] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/315 places, 296/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 306/315 places, 296/306 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s92 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-10 finished in 784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(!p0 U p1)) U X(p0)))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 308 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 308 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 305 transition count 295
Applied a total of 21 rules in 27 ms. Remains 305 /315 variables (removed 10) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:30:52] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-12 13:30:52] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-12 13:30:52] [INFO ] Invariant cache hit.
[2023-03-12 13:30:53] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-12 13:30:53] [INFO ] Invariant cache hit.
[2023-03-12 13:30:53] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/315 places, 295/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 305/315 places, 295/306 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s127 0) (EQ s82 1)), p1:(OR (EQ s43 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-04b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04b-LTLCardinality-13 finished in 1807 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((X(G(p1))||p0)))'
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 308 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 308 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 308 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 307 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 305 transition count 295
Applied a total of 21 rules in 19 ms. Remains 305 /315 variables (removed 10) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:30:54] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:30:54] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-12 13:30:54] [INFO ] Invariant cache hit.
[2023-03-12 13:30:54] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-12 13:30:54] [INFO ] Invariant cache hit.
[2023-03-12 13:30:55] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/315 places, 295/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 305/315 places, 295/306 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s172 0) (EQ s95 1)), p1:(OR (EQ s175 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 489 reset in 208 ms.
Product exploration explored 100000 steps with 490 reset in 169 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:30:56] [INFO ] Invariant cache hit.
[2023-03-12 13:30:56] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:30:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-12 13:30:56] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 13:30:56] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:30:56] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 0 ms to minimize.
[2023-03-12 13:30:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-12 13:30:57] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2023-03-12 13:30:57] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 15 ms to minimize.
[2023-03-12 13:30:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2023-03-12 13:30:57] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 13:30:57] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 295/295 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 305 transition count 188
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 120 rules applied. Total rules applied 227 place count 198 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 235 place count 190 transition count 175
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 235 place count 190 transition count 137
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 311 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 151 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 313 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 150 transition count 135
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 427 place count 94 transition count 72
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 443 place count 94 transition count 56
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 459 place count 78 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 77 transition count 55
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 33 rules applied. Total rules applied 493 place count 62 transition count 37
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 511 place count 44 transition count 37
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 511 place count 44 transition count 27
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 531 place count 34 transition count 27
Applied a total of 531 rules in 29 ms. Remains 34 /305 variables (removed 271) and now considering 27/295 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 34/305 places, 27/295 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 397 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-12 13:30:57] [INFO ] Invariant cache hit.
[2023-03-12 13:30:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-12 13:30:58] [INFO ] Invariant cache hit.
[2023-03-12 13:30:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-12 13:30:58] [INFO ] Invariant cache hit.
[2023-03-12 13:30:58] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 305/305 places, 295/295 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:30:59] [INFO ] Invariant cache hit.
[2023-03-12 13:30:59] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:30:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2023-03-12 13:30:59] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 13:30:59] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:30:59] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 1 ms to minimize.
[2023-03-12 13:30:59] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-12 13:30:59] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2023-03-12 13:30:59] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2023-03-12 13:30:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 457 ms
[2023-03-12 13:30:59] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 13:30:59] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 295/295 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 305 transition count 188
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 120 rules applied. Total rules applied 227 place count 198 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 235 place count 190 transition count 175
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 235 place count 190 transition count 137
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 311 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 312 place count 151 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 313 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 150 transition count 135
Performed 56 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 427 place count 94 transition count 72
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 443 place count 94 transition count 56
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 459 place count 78 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 460 place count 77 transition count 55
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 33 rules applied. Total rules applied 493 place count 62 transition count 37
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 511 place count 44 transition count 37
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 511 place count 44 transition count 27
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 531 place count 34 transition count 27
Applied a total of 531 rules in 25 ms. Remains 34 /305 variables (removed 271) and now considering 27/295 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 34/305 places, 27/295 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 490 reset in 166 ms.
Product exploration explored 100000 steps with 491 reset in 196 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 305 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 305 transition count 291
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 102 place count 305 transition count 291
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 143 place count 305 transition count 291
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 226 transition count 212
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 226 transition count 212
Performed 68 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 369 place count 226 transition count 205
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 414 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 459 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 459 rules in 77 ms. Remains 181 /305 variables (removed 124) and now considering 160/295 (removed 135) transitions.
[2023-03-12 13:31:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 160 rows 181 cols
[2023-03-12 13:31:01] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 13:31:01] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/305 places, 160/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 181/305 places, 160/295 transitions.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 6 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 305 cols
[2023-03-12 13:31:01] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-12 13:31:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 13:31:01] [INFO ] Invariant cache hit.
[2023-03-12 13:31:01] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-12 13:31:01] [INFO ] Invariant cache hit.
[2023-03-12 13:31:02] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 305/305 places, 295/295 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 7580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 314 transition count 201
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 119 rules applied. Total rules applied 223 place count 210 transition count 186
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 233 place count 202 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 200 transition count 184
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 235 place count 200 transition count 144
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 315 place count 160 transition count 144
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 321 place count 154 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 327 place count 154 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 327 place count 154 transition count 134
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 335 place count 150 transition count 134
Performed 54 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 443 place count 96 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 444 place count 96 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 445 place count 95 transition count 73
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 12 rules applied. Total rules applied 457 place count 87 transition count 69
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 461 place count 83 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 461 place count 83 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 469 place count 79 transition count 65
Applied a total of 469 rules in 35 ms. Remains 79 /315 variables (removed 236) and now considering 65/306 (removed 241) transitions.
// Phase 1: matrix 65 rows 79 cols
[2023-03-12 13:31:02] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-12 13:31:02] [INFO ] Implicit Places using invariants in 118 ms returned [45, 59, 69, 73, 78]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 121 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/315 places, 65/306 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 71 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 68 transition count 59
Applied a total of 12 rules in 4 ms. Remains 68 /74 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 68 cols
[2023-03-12 13:31:02] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-12 13:31:02] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 13:31:02] [INFO ] Invariant cache hit.
[2023-03-12 13:31:02] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/315 places, 59/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 484 ms. Remains : 68/315 places, 59/306 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 0) (EQ s62 1)), p1:(EQ s43 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4682 reset in 162 ms.
Stack based approach found an accepted trace after 11451 steps with 552 reset with depth 13 and stack size 13 in 20 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-15 finished in 763 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((X(G(p1))||p0)))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-14
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 315/315 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 314 transition count 196
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 123 rules applied. Total rules applied 232 place count 205 transition count 182
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 240 place count 197 transition count 182
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 240 place count 197 transition count 144
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 316 place count 159 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 322 place count 153 transition count 138
Iterating global reduction 3 with 6 rules applied. Total rules applied 328 place count 153 transition count 138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 328 place count 153 transition count 135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 334 place count 150 transition count 135
Performed 52 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 438 place count 98 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 98 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 440 place count 97 transition count 76
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 452 place count 89 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 456 place count 85 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 456 place count 85 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 464 place count 81 transition count 68
Applied a total of 464 rules in 50 ms. Remains 81 /315 variables (removed 234) and now considering 68/306 (removed 238) transitions.
// Phase 1: matrix 68 rows 81 cols
[2023-03-12 13:31:03] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-12 13:31:03] [INFO ] Implicit Places using invariants in 118 ms returned [67, 71, 75, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 120 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 77/315 places, 68/306 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 75 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 72 transition count 63
Applied a total of 10 rules in 3 ms. Remains 72 /77 variables (removed 5) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 72 cols
[2023-03-12 13:31:03] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-12 13:31:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 13:31:03] [INFO ] Invariant cache hit.
[2023-03-12 13:31:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:03] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 72/315 places, 63/306 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 323 ms. Remains : 72/315 places, 63/306 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s33 0) (EQ s25 1)), p1:(OR (EQ s35 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5202 reset in 108 ms.
Product exploration explored 100000 steps with 5202 reset in 188 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:31:04] [INFO ] Invariant cache hit.
[2023-03-12 13:31:04] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:31:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-12 13:31:04] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:31:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:04] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:31:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-12 13:31:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2023-03-12 13:31:04] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2023-03-12 13:31:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2023-03-12 13:31:04] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 13:31:04] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 63/63 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 72 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 62
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 6 place count 69 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 69 transition count 59
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 26 place count 69 transition count 40
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t194.t190.t245.t191.t189.t24.t57.t295.t25 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 42 vertex of which 2 / 42 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 15 rules applied. Total rules applied 41 place count 41 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 55 place count 29 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 55 place count 29 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 63 place count 25 transition count 20
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 66 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 21 transition count 16
Applied a total of 70 rules in 7 ms. Remains 21 /72 variables (removed 51) and now considering 16/63 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 21/72 places, 16/63 transitions.
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 483 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-12 13:31:05] [INFO ] Invariant cache hit.
[2023-03-12 13:31:05] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 13:31:05] [INFO ] Invariant cache hit.
[2023-03-12 13:31:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:05] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-12 13:31:05] [INFO ] Invariant cache hit.
[2023-03-12 13:31:05] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 72/72 places, 63/63 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 514 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:31:06] [INFO ] Invariant cache hit.
[2023-03-12 13:31:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:31:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 45 ms returned sat
[2023-03-12 13:31:06] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:31:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:06] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:31:06] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-12 13:31:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2023-03-12 13:31:06] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2023-03-12 13:31:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2023-03-12 13:31:06] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 13:31:06] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 63/63 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 72 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 71 transition count 62
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 6 place count 69 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 69 transition count 59
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 26 place count 69 transition count 40
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t194.t190.t245.t191.t189.t24.t57.t295.t25 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 42 vertex of which 2 / 42 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 15 rules applied. Total rules applied 41 place count 41 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 55 place count 29 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 55 place count 29 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 63 place count 25 transition count 20
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 66 place count 25 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 69 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 21 transition count 16
Applied a total of 70 rules in 6 ms. Remains 21 /72 variables (removed 51) and now considering 16/63 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 21/72 places, 16/63 transitions.
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 p1), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5199 reset in 199 ms.
Product exploration explored 100000 steps with 5191 reset in 239 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-12 13:31:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:31:08] [INFO ] Invariant cache hit.
[2023-03-12 13:31:08] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 72/72 places, 63/63 transitions.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 72 /72 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-12 13:31:08] [INFO ] Invariant cache hit.
[2023-03-12 13:31:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 13:31:08] [INFO ] Invariant cache hit.
[2023-03-12 13:31:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:31:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-12 13:31:08] [INFO ] Invariant cache hit.
[2023-03-12 13:31:08] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 72/72 places, 63/63 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 5829 ms.
[2023-03-12 13:31:08] [INFO ] Flatten gal took : 17 ms
[2023-03-12 13:31:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 13:31:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 315 places, 306 transitions and 742 arcs took 3 ms.
Total runtime 27676 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1259/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-04b-LTLCardinality-14

BK_STOP 1678627869346

--------------------
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-04b-LTLCardinality-14
ltl formula formula --ltl=/tmp/1259/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 315 places, 306 transitions and 742 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1259/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;