Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593100395.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593100395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.7K Feb 25 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 48K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678512777249

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 05:32:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:32:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:32:59] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-11 05:32:59] [INFO ] Transformed 206 places.
[2023-03-11 05:32:59] [INFO ] Transformed 204 transitions.
[2023-03-11 05:32:59] [INFO ] Found NUPN structural information;
[2023-03-11 05:32:59] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 180
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 182 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 176 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 176 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 174 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 174 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 172 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 172 transition count 166
Applied a total of 72 rules in 75 ms. Remains 172 /206 variables (removed 34) and now considering 166/204 (removed 38) transitions.
// Phase 1: matrix 166 rows 172 cols
[2023-03-11 05:32:59] [INFO ] Computed 16 place invariants in 16 ms
[2023-03-11 05:33:00] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-11 05:33:00] [INFO ] Invariant cache hit.
[2023-03-11 05:33:00] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-11 05:33:00] [INFO ] Invariant cache hit.
[2023-03-11 05:33:00] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/206 places, 166/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 172/206 places, 166/204 transitions.
Support contains 30 out of 172 places after structural reductions.
[2023-03-11 05:33:00] [INFO ] Flatten gal took : 35 ms
[2023-03-11 05:33:00] [INFO ] Flatten gal took : 12 ms
[2023-03-11 05:33:00] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 28 out of 172 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:33:01] [INFO ] Invariant cache hit.
[2023-03-11 05:33:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 05:33:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-11 05:33:01] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:33:01] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 05:33:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
[2023-03-11 05:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-11 05:33:01] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 05:33:01] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 2 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-02b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-02b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 164 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 163 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 163 transition count 157
Applied a total of 18 rules in 31 ms. Remains 163 /172 variables (removed 9) and now considering 157/166 (removed 9) transitions.
// Phase 1: matrix 157 rows 163 cols
[2023-03-11 05:33:01] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-11 05:33:01] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 05:33:01] [INFO ] Invariant cache hit.
[2023-03-11 05:33:02] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-11 05:33:02] [INFO ] Invariant cache hit.
[2023-03-11 05:33:02] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/172 places, 157/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 163/172 places, 157/166 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s62 0), p1:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02b-LTLCardinality-05 finished in 1516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 171 transition count 113
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 111 place count 119 transition count 106
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 116 place count 115 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 114 transition count 105
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 117 place count 114 transition count 80
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 167 place count 89 transition count 80
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 173 place count 83 transition count 74
Iterating global reduction 4 with 6 rules applied. Total rules applied 179 place count 83 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 179 place count 83 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 82 transition count 73
Performed 29 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 239 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 52 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 242 place count 50 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 242 place count 50 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 246 place count 48 transition count 38
Applied a total of 246 rules in 43 ms. Remains 48 /172 variables (removed 124) and now considering 38/166 (removed 128) transitions.
// Phase 1: matrix 38 rows 48 cols
[2023-03-11 05:33:03] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 53 ms returned [19, 27, 41, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/172 places, 38/166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 36
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 41 transition count 35
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 41 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 40 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 40 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 38 transition count 32
Applied a total of 12 rules in 10 ms. Remains 38 /44 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 38 cols
[2023-03-11 05:33:03] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/172 places, 32/166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 38/172 places, 32/166 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-07 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 s33 0) (EQ s9 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 19 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-07 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 171 transition count 117
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 55 rules applied. Total rules applied 103 place count 123 transition count 110
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 119 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 117 transition count 108
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 111 place count 117 transition count 83
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 161 place count 92 transition count 83
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 166 place count 87 transition count 78
Iterating global reduction 4 with 5 rules applied. Total rules applied 171 place count 87 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 171 place count 87 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 85 transition count 76
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 231 place count 57 transition count 45
Applied a total of 231 rules in 14 ms. Remains 57 /172 variables (removed 115) and now considering 45/166 (removed 121) transitions.
// Phase 1: matrix 45 rows 57 cols
[2023-03-11 05:33:03] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 60 ms returned [22, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/172 places, 45/166 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 44
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 10 place count 50 transition count 40
Applied a total of 10 rules in 5 ms. Remains 50 /55 variables (removed 5) and now considering 40/45 (removed 5) transitions.
// Phase 1: matrix 40 rows 50 cols
[2023-03-11 05:33:03] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants and state equation in 59 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 : 50/172 places, 40/166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 50/172 places, 40/166 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-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:(OR (AND (EQ s48 0) (EQ s0 1)) (AND (EQ s20 0) (EQ s37 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 38 steps with 3 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-08 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 165 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 164 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 164 transition count 158
Applied a total of 16 rules in 15 ms. Remains 164 /172 variables (removed 8) and now considering 158/166 (removed 8) transitions.
// Phase 1: matrix 158 rows 164 cols
[2023-03-11 05:33:03] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:04] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 158/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 164/172 places, 158/166 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s19 0) (EQ s63 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 54 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLCardinality-11 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 165 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 164 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 164 transition count 158
Applied a total of 16 rules in 16 ms. Remains 164 /172 variables (removed 8) and now considering 158/166 (removed 8) transitions.
// Phase 1: matrix 158 rows 164 cols
[2023-03-11 05:33:04] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-11 05:33:04] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 05:33:04] [INFO ] Invariant cache hit.
[2023-03-11 05:33:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-11 05:33:04] [INFO ] Invariant cache hit.
[2023-03-11 05:33:04] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/172 places, 158/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 164/172 places, 158/166 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s33 0) (EQ s32 1)), p1:(AND (NEQ s72 0) (NEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 882 reset in 210 ms.
Product exploration explored 100000 steps with 879 reset in 173 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 484 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 296 steps, including 2 resets, run visited all 5 properties in 8 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 743 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-11 05:33:06] [INFO ] Invariant cache hit.
[2023-03-11 05:33:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 05:33:06] [INFO ] Invariant cache hit.
[2023-03-11 05:33:06] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-11 05:33:06] [INFO ] Invariant cache hit.
[2023-03-11 05:33:07] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 164/164 places, 158/158 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 506 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1041 steps, including 8 resets, run visited all 5 properties in 25 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 867 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 878 reset in 181 ms.
Product exploration explored 100000 steps with 879 reset in 175 ms.
Built C files in :
/tmp/ltsmin7518165465312852075
[2023-03-11 05:33:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7518165465312852075
Running compilation step : cd /tmp/ltsmin7518165465312852075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 532 ms.
Running link step : cd /tmp/ltsmin7518165465312852075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin7518165465312852075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8016554293019810840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-11 05:33:24] [INFO ] Invariant cache hit.
[2023-03-11 05:33:25] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-11 05:33:25] [INFO ] Invariant cache hit.
[2023-03-11 05:33:25] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-11 05:33:25] [INFO ] Invariant cache hit.
[2023-03-11 05:33:25] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757 ms. Remains : 164/164 places, 158/158 transitions.
Built C files in :
/tmp/ltsmin17265042831296924789
[2023-03-11 05:33:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17265042831296924789
Running compilation step : cd /tmp/ltsmin17265042831296924789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 235 ms.
Running link step : cd /tmp/ltsmin17265042831296924789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin17265042831296924789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6296212763748524390.hoa' '--buchi-type=spotba'
LTSmin run took 1872 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLCardinality-12 finished in 23639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 164 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 163 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 163 transition count 157
Applied a total of 18 rules in 7 ms. Remains 163 /172 variables (removed 9) and now considering 157/166 (removed 9) transitions.
// Phase 1: matrix 157 rows 163 cols
[2023-03-11 05:33:27] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-11 05:33:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 05:33:27] [INFO ] Invariant cache hit.
[2023-03-11 05:33:28] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-11 05:33:28] [INFO ] Invariant cache hit.
[2023-03-11 05:33:28] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/172 places, 157/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 163/172 places, 157/166 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-13 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 s133 1) (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 204 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 100 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-02b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02b-LTLCardinality-13 finished in 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G((F(p3)&&p2))||p1)))))'
Support contains 8 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 171 transition count 122
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 128 transition count 119
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 126 transition count 116
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 100 place count 123 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 122 transition count 113
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 101 place count 122 transition count 90
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 147 place count 99 transition count 90
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 151 place count 95 transition count 86
Iterating global reduction 5 with 4 rules applied. Total rules applied 155 place count 95 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 155 place count 95 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 94 transition count 85
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 219 place count 63 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 62 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 222 place count 60 transition count 50
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 222 place count 60 transition count 48
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 58 transition count 48
Applied a total of 226 rules in 16 ms. Remains 58 /172 variables (removed 114) and now considering 48/166 (removed 118) transitions.
// Phase 1: matrix 48 rows 58 cols
[2023-03-11 05:33:28] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 05:33:28] [INFO ] Implicit Places using invariants in 49 ms returned [26, 34, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/172 places, 48/166 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 50 transition count 43
Applied a total of 10 rules in 5 ms. Remains 50 /55 variables (removed 5) and now considering 43/48 (removed 5) transitions.
// Phase 1: matrix 43 rows 50 cols
[2023-03-11 05:33:28] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-11 05:33:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-11 05:33:28] [INFO ] Invariant cache hit.
[2023-03-11 05:33:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:33:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/172 places, 43/166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 50/172 places, 43/166 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : AutoFlight-PT-02b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 2}, { cond=(OR p1 p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s40 1)), p1:(OR (EQ s11 0) (EQ s48 1)), p2:(AND (EQ s25 0) (EQ s15 1)), p3:(OR (EQ s42 0) (EQ s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3839 reset in 196 ms.
Product exploration explored 100000 steps with 3841 reset in 156 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/50 stabilizing places and 5/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2))))]
Knowledge based reduction with 20 factoid took 2934 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter insensitive) to 6 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 385 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 21) seen :12
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 05:33:33] [INFO ] Invariant cache hit.
[2023-03-11 05:33:33] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:33:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 05:33:33] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:33:33] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:33:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 2 ms to minimize.
[2023-03-11 05:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-11 05:33:33] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 05:33:33] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 4 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 6 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p2 (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p3)))), (G (NOT (AND p2 (NOT p1) p0 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (F (OR (AND p2 (NOT p1)) (AND p2 (NOT p0)))), (F (OR (AND p2 (NOT p1) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) p1 p0))), (F (NOT (OR p2 p1))), (F (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))), (F (AND p2 (NOT p1))), (F (NOT (OR (AND p2 p0) (AND p1 p0)))), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1))), (F (AND p1 p0 (NOT p3))), (F (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (F (AND p2 p1 (NOT p3))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 (NOT p1) p0)), (F (AND p1 (NOT p3))), (F (AND p2 p1 p0)), (F (AND p2 p1 p0 (NOT p3))), (F (AND p2 p1))]
Knowledge based reduction with 23 factoid took 2991 ms. Reduced automaton from 6 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 43/43 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-11 05:33:37] [INFO ] Invariant cache hit.
[2023-03-11 05:33:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 05:33:37] [INFO ] Invariant cache hit.
[2023-03-11 05:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:33:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 05:33:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 05:33:37] [INFO ] Invariant cache hit.
[2023-03-11 05:33:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 50/50 places, 43/43 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/50 stabilizing places and 5/43 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (OR (AND p1 p0) (AND p0 p2))), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 p0) (AND p0 p2)))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2))))]
Knowledge based reduction with 8 factoid took 1568 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:33:40] [INFO ] Invariant cache hit.
[2023-03-11 05:33:40] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:33:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 05:33:40] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:33:40] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:40] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 05:33:40] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0 p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (OR (AND p1 p0) (AND p0 p2))), (X (NOT (OR (AND p1 p0) (AND p0 p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2))))), (X (X (OR (AND p1 p0) (AND p0 p2)))), (X (X (NOT (OR (AND p1 p0) (AND p0 p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (F (AND p2 p1 p0)), (F (NOT (AND (NOT p2) p1 p0))), (F (AND (NOT p2) (NOT p1))), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p3))), (F (AND p2 p1)), (F (OR (AND p2 (NOT p1)) (AND p2 (NOT p0)))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 (NOT p0) (NOT p3))), (F (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (F (NOT (OR (AND p2 p0) (AND p1 p0)))), (F (AND p2 (NOT p1) p0)), (F (NOT (OR p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 8 factoid took 1878 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3837 reset in 196 ms.
Product exploration explored 100000 steps with 3855 reset in 132 ms.
Built C files in :
/tmp/ltsmin7691768342447582005
[2023-03-11 05:33:43] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2023-03-11 05:33:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:33:43] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2023-03-11 05:33:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:33:43] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2023-03-11 05:33:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:33:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7691768342447582005
Running compilation step : cd /tmp/ltsmin7691768342447582005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin7691768342447582005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7691768342447582005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16690248587285038373.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA AutoFlight-PT-02b-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-02b-LTLCardinality-15 finished in 15263 ms.
All properties solved by simple procedures.
Total runtime 44656 ms.

BK_STOP 1678512824259

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-02b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593100395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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