About the Execution of 2023-gold for AutoFlight-PT-03a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
368.451 | 20733.00 | 38039.00 | 636.90 | TTFTFFFFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180000058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180000058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 22:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:42 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-03a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716275362518
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 07:09:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:09:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:09:26] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-21 07:09:26] [INFO ] Transformed 82 places.
[2024-05-21 07:09:26] [INFO ] Transformed 80 transitions.
[2024-05-21 07:09:26] [INFO ] Found NUPN structural information;
[2024-05-21 07:09:26] [INFO ] Parsed PT model containing 82 places and 80 transitions and 260 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
FORMULA AutoFlight-PT-03a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 18 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2024-05-21 07:09:26] [INFO ] Computed 22 invariants in 11 ms
[2024-05-21 07:09:26] [INFO ] Implicit Places using invariants in 327 ms returned [24, 27, 30, 47, 61, 67, 79]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 382 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/82 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 74 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 64
Applied a total of 2 rules in 14 ms. Remains 74 /75 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 74 cols
[2024-05-21 07:09:26] [INFO ] Computed 15 invariants in 5 ms
[2024-05-21 07:09:27] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 07:09:27] [INFO ] Invariant cache hit.
[2024-05-21 07:09:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:09:27] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 74/82 places, 64/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 729 ms. Remains : 74/82 places, 64/65 transitions.
Support contains 29 out of 74 places after structural reductions.
[2024-05-21 07:09:27] [INFO ] Flatten gal took : 52 ms
[2024-05-21 07:09:27] [INFO ] Flatten gal took : 23 ms
[2024-05-21 07:09:27] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 07:09:28] [INFO ] Invariant cache hit.
[2024-05-21 07:09:28] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-21 07:09:28] [INFO ] After 80ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2024-05-21 07:09:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:09:28] [INFO ] After 19ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :1 sat :2
[2024-05-21 07:09:29] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 8 ms to minimize.
[2024-05-21 07:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-21 07:09:29] [INFO ] After 140ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 07:09:29] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 07:09:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 07:09:29] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 07:09:29] [INFO ] After 21ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 07:09:29] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-21 07:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-21 07:09:29] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-21 07:09:29] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 74 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 67 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 67 transition count 49
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 57 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 55 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 54 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 53 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 52 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 51 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 51 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 46 transition count 36
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 46 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 40 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 39 transition count 29
Reduce places removed 11 places and 0 transitions.
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 23 rules applied. Total rules applied 92 place count 28 transition count 17
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 104 place count 16 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 104 place count 16 transition count 13
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 112 place count 12 transition count 13
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 115 place count 9 transition count 10
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 9 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 120 place count 9 transition count 8
Applied a total of 120 rules in 66 ms. Remains 9 /74 variables (removed 65) and now considering 8/64 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 9/74 places, 8/64 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 4 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 66 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 66 transition count 56
Applied a total of 16 rules in 37 ms. Remains 66 /74 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-05-21 07:09:30] [INFO ] Computed 15 invariants in 3 ms
[2024-05-21 07:09:30] [INFO ] Implicit Places using invariants in 108 ms returned [7, 14, 59, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 110 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/74 places, 56/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 53
Applied a total of 6 rules in 7 ms. Remains 59 /62 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-21 07:09:30] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 07:09:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 07:09:30] [INFO ] Invariant cache hit.
[2024-05-21 07:09:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:09:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/74 places, 53/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 59/74 places, 53/64 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s38 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03a-LTLFireability-00 finished in 1809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F((G((p1 U p2))||((p1 U p2)&&F(p3)))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Applied a total of 6 rules in 5 ms. Remains 71 /74 variables (removed 3) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 71 cols
[2024-05-21 07:09:31] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:31] [INFO ] Implicit Places using invariants in 65 ms returned [7, 21, 64, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/74 places, 61/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 60
Applied a total of 2 rules in 3 ms. Remains 66 /67 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 66 cols
[2024-05-21 07:09:31] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 07:09:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 07:09:31] [INFO ] Invariant cache hit.
[2024-05-21 07:09:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:09:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/74 places, 60/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 66/74 places, 60/64 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s19 1), p1:(AND (EQ s13 1) (EQ s28 1)), p3:(NEQ s5 1), p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 153 ms. Reduced automaton from 6 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03a-LTLFireability-03 finished in 1450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((X(G(p2))&&p1)))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 66 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 66 transition count 56
Applied a total of 16 rules in 19 ms. Remains 66 /74 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-05-21 07:09:33] [INFO ] Computed 15 invariants in 2 ms
[2024-05-21 07:09:33] [INFO ] Implicit Places using invariants in 96 ms returned [7, 14, 21, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/74 places, 56/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 53
Applied a total of 6 rules in 4 ms. Remains 59 /62 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-21 07:09:33] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 07:09:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 07:09:33] [INFO ] Invariant cache hit.
[2024-05-21 07:09:33] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/74 places, 53/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 59/74 places, 53/64 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s3 1), p1:(AND (EQ s53 1) (EQ s58 1)), p2:(AND (EQ s6 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-04 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||X(p2))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 66 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 66 transition count 56
Applied a total of 16 rules in 19 ms. Remains 66 /74 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-05-21 07:09:33] [INFO ] Computed 15 invariants in 2 ms
[2024-05-21 07:09:33] [INFO ] Implicit Places using invariants in 81 ms returned [14, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/74 places, 56/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 64/74 places, 56/64 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s58 1) (EQ s63 1)), p0:(AND (EQ s7 1) (EQ s43 1)), p2:(AND (EQ s20 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-05 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U (p2 U !p1)))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 74 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 67 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 67 transition count 49
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 57 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 55 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 54 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 53 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 52 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 51 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 51 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 47 transition count 37
Applied a total of 54 rules in 32 ms. Remains 47 /74 variables (removed 27) and now considering 37/64 (removed 27) transitions.
// Phase 1: matrix 37 rows 47 cols
[2024-05-21 07:09:34] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:34] [INFO ] Implicit Places using invariants in 87 ms returned [5, 12, 17, 18, 19, 20, 41, 46]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 88 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/74 places, 37/64 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 0 with 8 rules applied. Total rules applied 8 place count 39 transition count 29
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 31 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 30 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 30 transition count 28
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 22 place count 28 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 27 transition count 45
Applied a total of 24 rules in 9 ms. Remains 27 /39 variables (removed 12) and now considering 45/37 (removed -8) transitions.
// Phase 1: matrix 45 rows 27 cols
[2024-05-21 07:09:34] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 07:09:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 07:09:34] [INFO ] Invariant cache hit.
[2024-05-21 07:09:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 07:09:34] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/74 places, 45/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 27/74 places, 45/64 transitions.
Stuttering acceptance computed with spot in 234 ms :[p1, (NOT p1), (NOT p1), false, true]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s6 1), p2:(EQ s7 1), p0:(AND (EQ s9 1) (EQ s1 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 457 steps with 50 reset in 2 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-06 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 74 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 67 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 67 transition count 49
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 57 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 55 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 54 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 53 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 52 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 52 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 47 transition count 37
Applied a total of 54 rules in 23 ms. Remains 47 /74 variables (removed 27) and now considering 37/64 (removed 27) transitions.
// Phase 1: matrix 37 rows 47 cols
[2024-05-21 07:09:34] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:34] [INFO ] Implicit Places using invariants in 78 ms returned [5, 11, 17, 18, 19, 41, 46]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 79 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/74 places, 37/64 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 35 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 34 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 33 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 33 transition count 30
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 18 place count 31 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 30 transition count 43
Applied a total of 20 rules in 9 ms. Remains 30 /40 variables (removed 10) and now considering 43/37 (removed -6) transitions.
// Phase 1: matrix 43 rows 30 cols
[2024-05-21 07:09:34] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 07:09:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 07:09:34] [INFO ] Invariant cache hit.
[2024-05-21 07:09:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/74 places, 43/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 30/74 places, 43/64 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-07 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:(AND (EQ s14 1) (EQ s16 1)), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-07 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 74 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 67 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 67 transition count 49
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 57 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 55 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 54 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 53 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 52 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 51 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 51 transition count 41
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 45 transition count 35
Applied a total of 58 rules in 25 ms. Remains 45 /74 variables (removed 29) and now considering 35/64 (removed 29) transitions.
// Phase 1: matrix 35 rows 45 cols
[2024-05-21 07:09:35] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants in 71 ms returned [5, 10, 15, 16, 17, 18, 39, 44]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 73 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/74 places, 35/64 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 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 27
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 29 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 28 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 28 transition count 26
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 22 place count 26 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 25 transition count 43
Applied a total of 24 rules in 9 ms. Remains 25 /37 variables (removed 12) and now considering 43/35 (removed -8) transitions.
// Phase 1: matrix 43 rows 25 cols
[2024-05-21 07:09:35] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 07:09:35] [INFO ] Invariant cache hit.
[2024-05-21 07:09:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 07:09:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/74 places, 43/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 236 ms. Remains : 25/74 places, 43/64 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13001 reset in 277 ms.
Product exploration explored 100000 steps with 12839 reset in 366 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Detected a total of 1/25 stabilizing places and 5/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0)]
[2024-05-21 07:09:36] [INFO ] Invariant cache hit.
[2024-05-21 07:09:37] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 07:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:09:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 07:09:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 07:09:37] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-21 07:09:37] [INFO ] Computed and/alt/rep : 28/132/28 causal constraints (skipped 10 transitions) in 7 ms.
[2024-05-21 07:09:37] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-21 07:09:37] [INFO ] Invariant cache hit.
[2024-05-21 07:09:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 07:09:37] [INFO ] Invariant cache hit.
[2024-05-21 07:09:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 07:09:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-21 07:09:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:09:37] [INFO ] Invariant cache hit.
[2024-05-21 07:09:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 25/25 places, 43/43 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Detected a total of 1/25 stabilizing places and 5/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
[2024-05-21 07:09:37] [INFO ] Invariant cache hit.
[2024-05-21 07:09:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 07:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:09:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 07:09:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 07:09:38] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-21 07:09:38] [INFO ] Computed and/alt/rep : 28/132/28 causal constraints (skipped 10 transitions) in 14 ms.
[2024-05-21 07:09:38] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12791 reset in 203 ms.
Product exploration explored 100000 steps with 12925 reset in 561 ms.
Built C files in :
/tmp/ltsmin13984542488143309694
[2024-05-21 07:09:38] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2024-05-21 07:09:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:09:38] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2024-05-21 07:09:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:09:38] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2024-05-21 07:09:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:09:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13984542488143309694
Running compilation step : cd /tmp/ltsmin13984542488143309694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin13984542488143309694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13984542488143309694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3109071868590295072.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03a-LTLFireability-08 finished in 4277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 74 transition count 59
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 69 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 12 place count 68 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 62 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 60 transition count 50
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 60 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 59 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 58 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 58 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 57 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 57 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 51 transition count 41
Applied a total of 46 rules in 11 ms. Remains 51 /74 variables (removed 23) and now considering 41/64 (removed 23) transitions.
// Phase 1: matrix 41 rows 51 cols
[2024-05-21 07:09:39] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:39] [INFO ] Implicit Places using invariants in 99 ms returned [5, 10, 15, 18, 19, 45, 50]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 100 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/74 places, 41/64 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 0 with 8 rules applied. Total rules applied 8 place count 44 transition count 33
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 36 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 36 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 35 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 34 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 34 transition count 31
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 2 with 6 rules applied. Total rules applied 26 place count 31 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 30 transition count 47
Applied a total of 28 rules in 16 ms. Remains 30 /44 variables (removed 14) and now considering 47/41 (removed -6) transitions.
// Phase 1: matrix 47 rows 30 cols
[2024-05-21 07:09:39] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 07:09:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 07:09:39] [INFO ] Invariant cache hit.
[2024-05-21 07:09:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-21 07:09:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/74 places, 47/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 30/74 places, 47/64 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s15 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-09 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 74 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 67 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 14 place count 67 transition count 49
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 59 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 57 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 57 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 56 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 56 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 55 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 54 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 54 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 53 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 52 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 51 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 51 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 46 transition count 36
Applied a total of 56 rules in 18 ms. Remains 46 /74 variables (removed 28) and now considering 36/64 (removed 28) transitions.
// Phase 1: matrix 36 rows 46 cols
[2024-05-21 07:09:39] [INFO ] Computed 15 invariants in 2 ms
[2024-05-21 07:09:39] [INFO ] Implicit Places using invariants in 77 ms returned [5, 11, 16, 17, 18, 19, 40, 45]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 78 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/74 places, 36/64 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 0 with 8 rules applied. Total rules applied 8 place count 38 transition count 28
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 30 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 29 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 29 transition count 27
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 22 place count 27 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 26 transition count 44
Applied a total of 24 rules in 5 ms. Remains 26 /38 variables (removed 12) and now considering 44/36 (removed -8) transitions.
// Phase 1: matrix 44 rows 26 cols
[2024-05-21 07:09:39] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 07:09:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 07:09:40] [INFO ] Invariant cache hit.
[2024-05-21 07:09:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-21 07:09:40] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/74 places, 44/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 26/74 places, 44/64 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14085 reset in 203 ms.
Stack based approach found an accepted trace after 2993 steps with 419 reset with depth 10 and stack size 10 in 19 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-11 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 63
Applied a total of 2 rules in 2 ms. Remains 73 /74 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-21 07:09:40] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:40] [INFO ] Implicit Places using invariants in 90 ms returned [7, 14, 21, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/74 places, 63/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 62
Applied a total of 2 rules in 1 ms. Remains 68 /69 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 68 cols
[2024-05-21 07:09:40] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 07:09:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 07:09:40] [INFO ] Invariant cache hit.
[2024-05-21 07:09:40] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 68/74 places, 62/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 68/74 places, 62/64 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-12 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(EQ s29 1), p1:(OR (NEQ s41 1) (NEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 3 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-12 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 72 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 57
Applied a total of 14 rules in 9 ms. Remains 67 /74 variables (removed 7) and now considering 57/64 (removed 7) transitions.
// Phase 1: matrix 57 rows 67 cols
[2024-05-21 07:09:41] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 70 ms returned [7, 14, 21, 59]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/74 places, 57/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 53
Applied a total of 8 rules in 4 ms. Remains 59 /63 variables (removed 4) and now considering 53/57 (removed 4) transitions.
// Phase 1: matrix 53 rows 59 cols
[2024-05-21 07:09:41] [INFO ] Computed 11 invariants in 1 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 07:09:41] [INFO ] Invariant cache hit.
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/74 places, 53/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 59/74 places, 53/64 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-13 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 s52 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-13 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 71 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 71 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 70 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 70 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 69 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 69 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 66 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 66 transition count 56
Applied a total of 16 rules in 9 ms. Remains 66 /74 variables (removed 8) and now considering 56/64 (removed 8) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-05-21 07:09:41] [INFO ] Computed 15 invariants in 1 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 75 ms returned [7, 14, 21, 59, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 77 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/74 places, 56/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 58 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 58 transition count 53
Applied a total of 6 rules in 3 ms. Remains 58 /61 variables (removed 3) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 58 cols
[2024-05-21 07:09:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 07:09:41] [INFO ] Invariant cache hit.
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/74 places, 53/64 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 58/74 places, 53/64 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-14 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:(NEQ s34 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 35 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-14 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 64/64 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 70 transition count 44
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 51 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 41 place count 51 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 53 place count 44 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 53 place count 44 transition count 37
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 57 place count 42 transition count 37
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 40 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 40 transition count 35
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 33 transition count 28
Applied a total of 75 rules in 11 ms. Remains 33 /74 variables (removed 41) and now considering 28/64 (removed 36) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-21 07:09:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 49 ms returned [28, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/74 places, 28/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 27
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 4 place count 29 transition count 26
Applied a total of 4 rules in 3 ms. Remains 29 /31 variables (removed 2) and now considering 26/28 (removed 2) transitions.
// Phase 1: matrix 26 rows 29 cols
[2024-05-21 07:09:41] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 07:09:41] [INFO ] Invariant cache hit.
[2024-05-21 07:09:41] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/74 places, 26/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 29/74 places, 26/64 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03a-LTLFireability-15 finished in 337 ms.
All properties solved by simple procedures.
Total runtime 15996 ms.
BK_STOP 1716275383251
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-03a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180000058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03a.tgz
mv AutoFlight-PT-03a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;