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.r007-oct2-167813595400380.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 lolaxred
Input is AutoFlight-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595400380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:05 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.4K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:07 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 26K 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-01b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678347951497

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:45:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 07:45:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:45:53] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-09 07:45:53] [INFO ] Transformed 114 places.
[2023-03-09 07:45:53] [INFO ] Transformed 112 transitions.
[2023-03-09 07:45:53] [INFO ] Found NUPN structural information;
[2023-03-09 07:45:53] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-01b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 106 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 106 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 106 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 105 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 105 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 104 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 104 transition count 100
Applied a total of 22 rules in 23 ms. Remains 104 /114 variables (removed 10) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 104 cols
[2023-03-09 07:45:54] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-09 07:45:54] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-09 07:45:54] [INFO ] Invariant cache hit.
[2023-03-09 07:45:54] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-09 07:45:54] [INFO ] Invariant cache hit.
[2023-03-09 07:45:54] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/114 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 104/114 places, 100/112 transitions.
Support contains 31 out of 104 places after structural reductions.
[2023-03-09 07:45:55] [INFO ] Flatten gal took : 42 ms
[2023-03-09 07:45:55] [INFO ] Flatten gal took : 25 ms
[2023-03-09 07:45:55] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 30 out of 104 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 33) seen :29
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 07:45:55] [INFO ] Invariant cache hit.
[2023-03-09 07:45:55] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 07:45:55] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 07:45:55] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2023-03-09 07:45:55] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 6 ms to minimize.
[2023-03-09 07:45:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2023-03-09 07:45:55] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2023-03-09 07:45:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2023-03-09 07:45:55] [INFO ] After 210ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 07:45:55] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 07:45:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 07:45:55] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:45:55] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 07:45:55] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2023-03-09 07:45:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 07:45:55] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 07:45:56] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 4 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA AutoFlight-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 30 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' '!(((F(p0) U X(p1)) U p2))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 93 transition count 89
Applied a total of 22 rules in 21 ms. Remains 93 /104 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:45:56] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-09 07:45:56] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 07:45:56] [INFO ] Invariant cache hit.
[2023-03-09 07:45:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-09 07:45:56] [INFO ] Invariant cache hit.
[2023-03-09 07:45:57] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 93/104 places, 89/100 transitions.
Stuttering acceptance computed with spot in 513 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s22 1), p0:(AND (EQ s30 1) (EQ s52 1)), p1:(AND (EQ s82 1) (EQ s89 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-00 finished in 1014 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' '!(((p0&&G(p1)) U (G(!p1)||X(G(p2)))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 92 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 92 transition count 88
Applied a total of 24 rules in 11 ms. Remains 92 /104 variables (removed 12) and now considering 88/100 (removed 12) transitions.
// Phase 1: matrix 88 rows 92 cols
[2023-03-09 07:45:57] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-09 07:45:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 07:45:57] [INFO ] Invariant cache hit.
[2023-03-09 07:45:57] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-09 07:45:57] [INFO ] Invariant cache hit.
[2023-03-09 07:45:57] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/104 places, 88/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 92/104 places, 88/100 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) (NOT p1)), (AND p1 (NOT p2)), true, p1, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s91 1), p1:(NEQ s67 1), p0:(NEQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 177 steps with 2 reset in 2 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-01 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(!p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 91 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 91 transition count 87
Applied a total of 26 rules in 12 ms. Remains 91 /104 variables (removed 13) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 91 cols
[2023-03-09 07:45:58] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-09 07:45:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 07:45:58] [INFO ] Invariant cache hit.
[2023-03-09 07:45:58] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-09 07:45:58] [INFO ] Invariant cache hit.
[2023-03-09 07:45:58] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/104 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 91/104 places, 87/100 transitions.
Stuttering acceptance computed with spot in 205 ms :[p1, p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s70 1) (EQ s87 1)), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-02 finished in 447 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) U p1) U (p2&&G(!p3)))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 93 transition count 89
Applied a total of 22 rules in 11 ms. Remains 93 /104 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:45:58] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:45:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 07:45:59] [INFO ] Invariant cache hit.
[2023-03-09 07:45:59] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-09 07:45:59] [INFO ] Invariant cache hit.
[2023-03-09 07:45:59] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 93/104 places, 89/100 transitions.
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), true, (NOT p0), (NOT p1), p3, p3, (AND (NOT p0) p3 p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0) (AND p3 p1) (AND p3 p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND p3 (NOT p1) p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND p3 (NOT p1) p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0} source=6 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p3 p1 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p3 p1 p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s87 1), p1:(EQ s28 1), p0:(EQ s13 1), p3:(OR (EQ s28 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-03 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 91 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 91 transition count 87
Applied a total of 26 rules in 10 ms. Remains 91 /104 variables (removed 13) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 91 cols
[2023-03-09 07:45:59] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:45:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 07:45:59] [INFO ] Invariant cache hit.
[2023-03-09 07:46:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-09 07:46:00] [INFO ] Invariant cache hit.
[2023-03-09 07:46:00] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/104 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 91/104 places, 87/100 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s28 1), p0:(OR (EQ s80 0) (EQ s87 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, null][false, false, false]]
Product exploration explored 100000 steps with 2392 reset in 304 ms.
Product exploration explored 100000 steps with 2409 reset in 218 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 71 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 471 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-09 07:46:02] [INFO ] Invariant cache hit.
[2023-03-09 07:46:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 07:46:02] [INFO ] Invariant cache hit.
[2023-03-09 07:46:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-09 07:46:02] [INFO ] Invariant cache hit.
[2023-03-09 07:46:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 91/91 places, 87/87 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 189 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 402 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2419 reset in 193 ms.
Product exploration explored 100000 steps with 2405 reset in 113 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 91 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 91 transition count 86
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 91 transition count 86
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 41 place count 91 transition count 86
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 61 place count 71 transition count 66
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 81 place count 71 transition count 66
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 100 place count 71 transition count 64
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 110 place count 61 transition count 54
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 61 transition count 54
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 120 rules in 100 ms. Remains 61 /91 variables (removed 30) and now considering 54/87 (removed 33) transitions.
[2023-03-09 07:46:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 61 cols
[2023-03-09 07:46:04] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:46:05] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/91 places, 54/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 61/91 places, 54/87 transitions.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 91 cols
[2023-03-09 07:46:05] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 07:46:05] [INFO ] Invariant cache hit.
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-09 07:46:05] [INFO ] Invariant cache hit.
[2023-03-09 07:46:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 91/91 places, 87/87 transitions.
Treatment of property AutoFlight-PT-01b-LTLFireability-04 finished in 5638 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' '!((p0 U (p1 U p2)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 103 transition count 75
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 79 transition count 73
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 77 transition count 72
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 53 place count 77 transition count 54
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 89 place count 59 transition count 54
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 53 transition count 48
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 53 transition count 48
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 101 place count 53 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 49 transition count 44
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 139 place count 34 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 33 transition count 28
Applied a total of 141 rules in 26 ms. Remains 33 /104 variables (removed 71) and now considering 28/100 (removed 72) transitions.
// Phase 1: matrix 28 rows 33 cols
[2023-03-09 07:46:05] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants in 60 ms returned [12, 13, 18, 32]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/104 places, 28/100 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 29 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 27 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 27 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 26 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 26 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 24 transition count 23
Applied a total of 10 rules in 6 ms. Remains 24 /29 variables (removed 5) and now considering 23/28 (removed 5) transitions.
// Phase 1: matrix 23 rows 24 cols
[2023-03-09 07:46:05] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 07:46:05] [INFO ] Invariant cache hit.
[2023-03-09 07:46:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/104 places, 23/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 24/104 places, 23/100 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s10 1), p1:(NEQ s22 1), p0:(EQ s5 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, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-05 finished in 395 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 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 103 transition count 70
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 33 rules applied. Total rules applied 62 place count 74 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 72 transition count 66
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 64 place count 72 transition count 49
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 98 place count 55 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 49 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 49 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 110 place count 49 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 46 transition count 40
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 148 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 28 transition count 21
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 152 place count 27 transition count 21
Applied a total of 152 rules in 21 ms. Remains 27 /104 variables (removed 77) and now considering 21/100 (removed 79) transitions.
// Phase 1: matrix 21 rows 27 cols
[2023-03-09 07:46:05] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants in 62 ms returned [10, 15, 20, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/104 places, 21/100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 19
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 20 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 20 transition count 18
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 8 place count 19 transition count 17
Applied a total of 8 rules in 3 ms. Remains 19 /23 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-09 07:46:05] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 07:46:05] [INFO ] Invariant cache hit.
[2023-03-09 07:46:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 07:46:05] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/104 places, 17/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 19/104 places, 17/100 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 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 14 steps with 2 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-06 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||G(p2))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 104 transition count 73
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 31 rules applied. Total rules applied 58 place count 77 transition count 69
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 75 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 73 transition count 67
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 64 place count 73 transition count 48
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 102 place count 54 transition count 48
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 108 place count 48 transition count 42
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 48 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 114 place count 48 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 120 place count 45 transition count 39
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 146 place count 32 transition count 25
Applied a total of 146 rules in 36 ms. Remains 32 /104 variables (removed 72) and now considering 25/100 (removed 75) transitions.
// Phase 1: matrix 25 rows 32 cols
[2023-03-09 07:46:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 07:46:06] [INFO ] Implicit Places using invariants in 63 ms returned [19, 24, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/104 places, 25/100 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 28 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 24
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 6 place count 26 transition count 22
Applied a total of 6 rules in 6 ms. Remains 26 /29 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 26 cols
[2023-03-09 07:46:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 07:46:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 07:46:06] [INFO ] Invariant cache hit.
[2023-03-09 07:46:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 07:46:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/104 places, 22/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 26/104 places, 22/100 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s11 1), p2:(NEQ s0 1), p0:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-09 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((X(X(!p0))&&G(p1))||X(X(G(!p0))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 93 transition count 89
Applied a total of 22 rules in 9 ms. Remains 93 /104 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:46:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:46:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 07:46:06] [INFO ] Invariant cache hit.
[2023-03-09 07:46:06] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-09 07:46:06] [INFO ] Invariant cache hit.
[2023-03-09 07:46:06] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 93/104 places, 89/100 transitions.
Stuttering acceptance computed with spot in 403 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(EQ s20 1), p1:(NEQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24928 reset in 132 ms.
Product exploration explored 100000 steps with 25035 reset in 84 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/93 stabilizing places and 25/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND p1 p0))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1242 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 149 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:46:09] [INFO ] Invariant cache hit.
[2023-03-09 07:46:09] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 07:46:09] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:46:09] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 07:46:09] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 07:46:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-09 07:46:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 07:46:09] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 07:46:09] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:46:09] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 07:46:09] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND p1 p0))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 1000 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 497 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 07:46:11] [INFO ] Invariant cache hit.
[2023-03-09 07:46:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 07:46:11] [INFO ] Invariant cache hit.
[2023-03-09 07:46:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-09 07:46:12] [INFO ] Invariant cache hit.
[2023-03-09 07:46:12] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 93/93 places, 89/89 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/93 stabilizing places and 25/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 784 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 572 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 148 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-09 07:46:13] [INFO ] Invariant cache hit.
[2023-03-09 07:46:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 07:46:13] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 07:46:13] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 07:46:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 07:46:13] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:46:13] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 07:46:13] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 07:46:13] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 1129 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 481 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 488 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24945 reset in 147 ms.
Product exploration explored 100000 steps with 24959 reset in 128 ms.
Applying partial POR strategy [false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 484 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 89/89 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 93 transition count 88
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 93 transition count 89
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 93 transition count 89
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 73 transition count 69
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 73 transition count 69
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 102 place count 73 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 73 transition count 67
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 112 place count 64 transition count 58
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 121 place count 64 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 64 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 63 transition count 57
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 63 transition count 57
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 124 rules in 41 ms. Remains 63 /93 variables (removed 30) and now considering 57/89 (removed 32) transitions.
[2023-03-09 07:46:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 57 rows 63 cols
[2023-03-09 07:46:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:46:17] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/93 places, 57/89 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 63/93 places, 57/89 transitions.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:46:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:46:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 07:46:17] [INFO ] Invariant cache hit.
[2023-03-09 07:46:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-09 07:46:17] [INFO ] Invariant cache hit.
[2023-03-09 07:46:17] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 93/93 places, 89/89 transitions.
Treatment of property AutoFlight-PT-01b-LTLFireability-10 finished in 11225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U X((p1&&G(p2))))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 95 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 95 transition count 91
Applied a total of 18 rules in 6 ms. Remains 95 /104 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 95 cols
[2023-03-09 07:46:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 07:46:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 07:46:17] [INFO ] Invariant cache hit.
[2023-03-09 07:46:18] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-09 07:46:18] [INFO ] Invariant cache hit.
[2023-03-09 07:46:18] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 95/104 places, 91/100 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s31 1), p1:(EQ s7 1), p2:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-11 finished in 770 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)&&X((p1&&F(G(p2))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 91 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 91 transition count 87
Applied a total of 26 rules in 4 ms. Remains 91 /104 variables (removed 13) and now considering 87/100 (removed 13) transitions.
// Phase 1: matrix 87 rows 91 cols
[2023-03-09 07:46:18] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-09 07:46:18] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 07:46:18] [INFO ] Invariant cache hit.
[2023-03-09 07:46:19] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-09 07:46:19] [INFO ] Invariant cache hit.
[2023-03-09 07:46:19] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/104 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 91/104 places, 87/100 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s37 1), p1:(EQ s37 0), p2:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-01b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01b-LTLFireability-13 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X((F(!p1)||G(p0))))) U (X(p3)||p2)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 93 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 93 transition count 89
Applied a total of 22 rules in 4 ms. Remains 93 /104 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:46:19] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 07:46:19] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-09 07:46:19] [INFO ] Invariant cache hit.
[2023-03-09 07:46:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-09 07:46:19] [INFO ] Invariant cache hit.
[2023-03-09 07:46:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 93/104 places, 89/100 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p3)), 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=[p2:(OR (EQ s2 1) (EQ s24 1)), p0:(NEQ s18 1), p3:(EQ s2 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]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/93 stabilizing places and 23/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X p3), (X (NOT (AND p0 (NOT p3)))), true, (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) p0 (NOT p3)))), (X (X p0)), (X (X (AND p0 (NOT p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 11 factoid took 311 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-01b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01b-LTLFireability-14 finished in 1118 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 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 93 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 93 transition count 89
Applied a total of 22 rules in 2 ms. Remains 93 /104 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 93 cols
[2023-03-09 07:46:20] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 07:46:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 07:46:20] [INFO ] Invariant cache hit.
[2023-03-09 07:46:20] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-09 07:46:20] [INFO ] Invariant cache hit.
[2023-03-09 07:46:20] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 93/104 places, 89/100 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s15 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 69 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 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 86 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-01b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-01b-LTLFireability-15 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((X(X(!p0))&&G(p1))||X(X(G(!p0))))))'
[2023-03-09 07:46:21] [INFO ] Flatten gal took : 15 ms
[2023-03-09 07:46:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-09 07:46:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 100 transitions and 240 arcs took 3 ms.
Total runtime 27660 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-01b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA AutoFlight-PT-01b-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678348036924

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-01b-LTLFireability-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-01b-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 7/32 AutoFlight-PT-01b-LTLFireability-04 976539 m, 195307 m/sec, 4805551 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-01b-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 13/32 AutoFlight-PT-01b-LTLFireability-04 1882560 m, 181204 m/sec, 9574078 t fired, .

Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-01b-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 18/32 AutoFlight-PT-01b-LTLFireability-04 2659746 m, 155437 m/sec, 14250407 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for AutoFlight-PT-01b-LTLFireability-04
lola: result : false
lola: markings : 2862738
lola: fired transitions : 15497456
lola: time used : 17.000000
lola: memory pages used : 19
lola: LAUNCH task # 4 (type EXCL) for 3 AutoFlight-PT-01b-LTLFireability-10
lola: time limit : 3583 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 3/3583 5/32 AutoFlight-PT-01b-LTLFireability-10 688607 m, 137721 m/sec, 3538453 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 8/3583 10/32 AutoFlight-PT-01b-LTLFireability-10 1444594 m, 151197 m/sec, 7709297 t fired, .

Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 13/3583 15/32 AutoFlight-PT-01b-LTLFireability-10 2146507 m, 140382 m/sec, 11978375 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 18/3583 19/32 AutoFlight-PT-01b-LTLFireability-10 2813072 m, 133313 m/sec, 16348172 t fired, .

Time elapsed: 35 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 23/3583 24/32 AutoFlight-PT-01b-LTLFireability-10 3427734 m, 122932 m/sec, 20593146 t fired, .

Time elapsed: 40 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 28/3583 28/32 AutoFlight-PT-01b-LTLFireability-10 4050744 m, 124602 m/sec, 25039568 t fired, .

Time elapsed: 45 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 33/3583 30/32 AutoFlight-PT-01b-LTLFireability-10 4455892 m, 81029 m/sec, 28863339 t fired, .

Time elapsed: 50 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for AutoFlight-PT-01b-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-01b-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-01b-LTLFireability-04: LTL false LTL model checker
AutoFlight-PT-01b-LTLFireability-10: LTL unknown AGGR


Time elapsed: 55 secs. Pages in use: 32

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-01b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutoFlight-PT-01b, 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 r007-oct2-167813595400380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;