fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989900394
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for AutoFlight-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
802.495 73916.00 92507.00 578.80 FFTFTFFTFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989900394.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989900394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 48K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620466350215

Running Version 0
[2021-05-08 09:32:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 09:32:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:32:31] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-08 09:32:31] [INFO ] Transformed 206 places.
[2021-05-08 09:32:31] [INFO ] Transformed 204 transitions.
[2021-05-08 09:32:31] [INFO ] Found NUPN structural information;
[2021-05-08 09:32:31] [INFO ] Parsed PT model containing 206 places and 204 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 09:32:31] [INFO ] Initial state test concluded for 1 properties.
Support contains 43 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 189 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 189 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 189 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 181 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 181 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 180 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 180 transition count 177
Applied a total of 53 rules in 53 ms. Remains 180 /206 variables (removed 26) and now considering 177/204 (removed 27) transitions.
// Phase 1: matrix 177 rows 180 cols
[2021-05-08 09:32:31] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-08 09:32:32] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 177 rows 180 cols
[2021-05-08 09:32:32] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-08 09:32:32] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 180 cols
[2021-05-08 09:32:32] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-08 09:32:32] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/206 places, 177/204 transitions.
[2021-05-08 09:32:32] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 09:32:32] [INFO ] Flatten gal took : 38 ms
FORMULA AutoFlight-PT-02b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:32:32] [INFO ] Flatten gal took : 14 ms
[2021-05-08 09:32:32] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 100000 steps, including 878 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 36) seen :32
Running SMT prover for 4 properties.
// Phase 1: matrix 177 rows 180 cols
[2021-05-08 09:32:32] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 09:32:32] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 09:32:32] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 09:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:33] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 09:32:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:32:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-08 09:32:33] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 09:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:33] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-08 09:32:33] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 3 ms to minimize.
[2021-05-08 09:32:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-08 09:32:33] [INFO ] Computed and/alt/rep : 176/247/176 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-08 09:32:33] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2021-05-08 09:32:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-08 09:32:33] [INFO ] Added : 170 causal constraints over 34 iterations in 552 ms. Result :sat
[2021-05-08 09:32:33] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-08 09:32:33] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 09:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:33] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 2 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2021-05-08 09:32:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2021-05-08 09:32:34] [INFO ] Computed and/alt/rep : 176/247/176 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-08 09:32:34] [INFO ] Added : 167 causal constraints over 34 iterations in 421 ms. Result :sat
[2021-05-08 09:32:34] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned unsat
[2021-05-08 09:32:34] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-08 09:32:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:32:34] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2021-05-08 09:32:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2021-05-08 09:32:34] [INFO ] Computed and/alt/rep : 176/247/176 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-08 09:32:35] [INFO ] Added : 176 causal constraints over 36 iterations in 365 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 116
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 69 rules applied. Total rules applied 129 place count 119 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 107
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 133 place count 115 transition count 84
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 179 place count 92 transition count 84
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 86 transition count 78
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 86 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 191 place count 86 transition count 74
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 199 place count 82 transition count 74
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 259 place count 52 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 51 transition count 40
Reduce places removed 3 places and 0 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 3 with 4 rules applied. Total rules applied 264 place count 48 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 47 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 265 place count 47 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 45 transition count 37
Applied a total of 269 rules in 33 ms. Remains 45 /180 variables (removed 135) and now considering 37/177 (removed 140) transitions.
// Phase 1: matrix 37 rows 45 cols
[2021-05-08 09:32:35] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:32:35] [INFO ] Implicit Places using invariants in 33 ms returned [17, 34, 38, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
[2021-05-08 09:32:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 41 cols
[2021-05-08 09:32:35] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-08 09:32:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 41/180 places, 37/177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 35
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 6 place count 38 transition count 34
Applied a total of 6 rules in 3 ms. Remains 38 /41 variables (removed 3) and now considering 34/37 (removed 3) transitions.
// Phase 1: matrix 34 rows 38 cols
[2021-05-08 09:32:35] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-08 09:32:35] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 34 rows 38 cols
[2021-05-08 09:32:35] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:32:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:32:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 38/180 places, 34/177 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s23 1), p1:(AND (NEQ s23 0) (NEQ s1 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8392 reset in 310 ms.
Stack based approach found an accepted trace after 95523 steps with 7968 reset with depth 21 and stack size 21 in 175 ms.
FORMULA AutoFlight-PT-02b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-00 finished in 807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F(p0))&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 169 transition count 166
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 169 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 169 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 165 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 165 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 163 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 163 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 162 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 162 transition count 156
Applied a total of 39 rules in 18 ms. Remains 162 /180 variables (removed 18) and now considering 156/177 (removed 21) transitions.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:36] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 09:32:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/180 places, 156/177 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s68 1), p2:(AND (NEQ s154 1) (NEQ s68 1)), p1:(NEQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-01 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G((F(p0)&&F(G(p1))))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 170 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 170 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 170 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 166 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 164 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 163 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 163 transition count 157
Applied a total of 37 rules in 17 ms. Remains 163 /180 variables (removed 17) and now considering 157/177 (removed 20) transitions.
// Phase 1: matrix 157 rows 163 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:36] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 157 rows 163 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-08 09:32:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 163 cols
[2021-05-08 09:32:36] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 09:32:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/180 places, 157/177 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (NEQ s25 1) (NEQ s132 1)), p0:(NEQ s105 1), p1:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 874 reset in 209 ms.
Product exploration explored 100000 steps with 879 reset in 206 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 882 reset in 143 ms.
Product exploration explored 100000 steps with 881 reset in 157 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 163/163 places, 157/157 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 163 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 163 transition count 155
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 49 place count 163 transition count 168
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 73 place count 163 transition count 168
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 107 place count 129 transition count 134
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 141 place count 129 transition count 134
Performed 38 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 179 place count 129 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 129 transition count 130
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 203 place count 106 transition count 107
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 226 place count 106 transition count 107
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 226 rules in 21 ms. Remains 106 /163 variables (removed 57) and now considering 107/157 (removed 50) transitions.
[2021-05-08 09:32:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 107 rows 106 cols
[2021-05-08 09:32:38] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-08 09:32:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 106/163 places, 107/157 transitions.
Product exploration explored 100000 steps with 5444 reset in 356 ms.
Product exploration explored 100000 steps with 5464 reset in 228 ms.
[2021-05-08 09:32:39] [INFO ] Flatten gal took : 9 ms
[2021-05-08 09:32:39] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:32:39] [INFO ] Time to serialize gal into /tmp/LTL13449735113866763421.gal : 4 ms
[2021-05-08 09:32:39] [INFO ] Time to serialize properties into /tmp/LTL16855139559384277724.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13449735113866763421.gal, -t, CGAL, -LTL, /tmp/LTL16855139559384277724.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13449735113866763421.gal -t CGAL -LTL /tmp/LTL16855139559384277724.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G((F("(p145!=1)"))&&(F(G("(p26!=1)")))))||(G("((p31!=1)||(p173!=1))"))))))
Formula 0 simplified : !XX(G(F"(p145!=1)" & FG"(p26!=1)") | G"((p31!=1)||(p173!=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t7, t19, t27, t38, t44, t56, t60, t62, t63, t74, t76, t77, t88, t93, t97, t100, t104, t108, t115, t122, t126, t127, t129, t137, t170, t171, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/126/31/157
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
[2021-05-08 09:32:54] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:32:54] [INFO ] Applying decomposition
[2021-05-08 09:32:54] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14524629512405762990.txt, -o, /tmp/graph14524629512405762990.bin, -w, /tmp/graph14524629512405762990.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14524629512405762990.bin, -l, -1, -v, -w, /tmp/graph14524629512405762990.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 09:32:54] [INFO ] Decomposing Gal with order
[2021-05-08 09:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 09:32:54] [INFO ] Removed a total of 34 redundant transitions.
[2021-05-08 09:32:54] [INFO ] Flatten gal took : 35 ms
[2021-05-08 09:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2021-05-08 09:32:54] [INFO ] Time to serialize gal into /tmp/LTL4907065469608464182.gal : 7 ms
[2021-05-08 09:32:54] [INFO ] Time to serialize properties into /tmp/LTL5029837971170789785.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4907065469608464182.gal, -t, CGAL, -LTL, /tmp/LTL5029837971170789785.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4907065469608464182.gal -t CGAL -LTL /tmp/LTL5029837971170789785.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((G((F("(i11.i0.u42.p145!=1)"))&&(F(G("(i2.u8.p26!=1)")))))||(G("((i2.u7.p31!=1)||(i12.u55.p173!=1))"))))))
Formula 0 simplified : !XX(G(F"(i11.i0.u42.p145!=1)" & FG"(i2.u8.p26!=1)") | G"((i2.u7.p31!=1)||(i12.u55.p173!=1))")
Reverse transition relation is NOT exact ! Due to transitions t60, t63, t74, t77, t97, t104, t126, t170, t171, t172, i1.u6.t0, i1.u6.t137, i2.t3, i2.u8.t2, i2.u9.t129, i3.t122, i3.u12.t115, i4.u15.t6, i4.u15.t108, i5.u16.t7, i5.u16.t100, i6.t93, i6.u21.t88, i9.t62, i11.i0.u42.t56, i12.t76, i14.t38, i15.i1.t27, i16.i1.t44, i16.i2.u66.t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/126/30/156
Computing Next relation with stutter on 40 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 items max in DFS search stack
405 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.07015,142952,1,0,321486,247,2225,381498,155,900,444313
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-02b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-02b-03 finished in 22278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 179 transition count 119
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 66 rules applied. Total rules applied 123 place count 122 transition count 110
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 128 place count 118 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 117 transition count 109
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 129 place count 117 transition count 85
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 177 place count 93 transition count 85
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 183 place count 87 transition count 79
Iterating global reduction 4 with 6 rules applied. Total rules applied 189 place count 87 transition count 79
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 189 place count 87 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 193 place count 85 transition count 77
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 253 place count 55 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 55 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 54 transition count 43
Reduce places removed 3 places and 0 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 4 with 4 rules applied. Total rules applied 259 place count 51 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 260 place count 50 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 260 place count 50 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 264 place count 48 transition count 40
Applied a total of 264 rules in 19 ms. Remains 48 /180 variables (removed 132) and now considering 40/177 (removed 137) transitions.
// Phase 1: matrix 40 rows 48 cols
[2021-05-08 09:32:58] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:32:58] [INFO ] Implicit Places using invariants in 37 ms returned [21, 29, 37, 41, 47]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
[2021-05-08 09:32:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 43 cols
[2021-05-08 09:32:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 43/180 places, 40/177 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 37
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 36
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 38 transition count 35
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 38 transition count 35
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 12 place count 37 transition count 34
Applied a total of 12 rules in 6 ms. Remains 37 /43 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 37 cols
[2021-05-08 09:32:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 34 rows 37 cols
[2021-05-08 09:32:59] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:32:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 37/180 places, 34/177 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-02b-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s10 1) (NEQ s3 1)), p0:(NEQ s20 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][true, true, true]]
Entered a terminal (fully accepting) state of product in 1766 steps with 111 reset in 2 ms.
FORMULA AutoFlight-PT-02b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-05 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 171 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 171 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 171 transition count 166
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 168 transition count 163
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 168 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 167 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 167 transition count 162
Applied a total of 28 rules in 13 ms. Remains 167 /180 variables (removed 13) and now considering 162/177 (removed 15) transitions.
// Phase 1: matrix 162 rows 167 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 162 rows 167 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 167 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-08 09:32:59] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 167/180 places, 162/177 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s41 1), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-06 finished in 344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||(X((p1||F(p2))) U ((p3&&X((p1||F(p2))))||X(G((p1||F(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 170 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 170 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 170 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 167 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 167 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 165 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 164 transition count 158
Applied a total of 35 rules in 16 ms. Remains 164 /180 variables (removed 16) and now considering 158/177 (removed 19) transitions.
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:32:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:32:59] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/180 places, 158/177 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s162 1)), p1:(NEQ s43 1), p2:(OR (NEQ s17 1) (NEQ s132 1)), p3:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 143 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Knowledge obtained : [(NOT p0), p1, p2, p3]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 164/164 places, 158/158 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 164 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 164 transition count 156
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 50 place count 164 transition count 163
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 73 place count 164 transition count 163
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 108 place count 129 transition count 128
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 143 place count 129 transition count 128
Performed 38 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 181 place count 129 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 129 transition count 124
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 205 place count 107 transition count 102
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 227 place count 107 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 107 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 106 transition count 101
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 106 transition count 101
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 230 rules in 22 ms. Remains 106 /164 variables (removed 58) and now considering 101/158 (removed 57) transitions.
[2021-05-08 09:33:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 106 cols
[2021-05-08 09:33:01] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 106/164 places, 101/158 transitions.
Product exploration explored 100000 steps with 33333 reset in 369 ms.
Product exploration explored 100000 steps with 33333 reset in 375 ms.
[2021-05-08 09:33:01] [INFO ] Flatten gal took : 8 ms
[2021-05-08 09:33:01] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:33:01] [INFO ] Time to serialize gal into /tmp/LTL9705971016050640061.gal : 2 ms
[2021-05-08 09:33:01] [INFO ] Time to serialize properties into /tmp/LTL2316944245569406186.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9705971016050640061.gal, -t, CGAL, -LTL, /tmp/LTL2316944245569406186.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9705971016050640061.gal -t CGAL -LTL /tmp/LTL2316944245569406186.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p154==1)&&(p204==1))"))||((X(("(p61!=1)")||(F("((p20!=1)||(p172!=1))"))))U((("(p20!=1)")&&(X(("(p61!=1)")||(F("((p20!=1)||(p172!=1))")))))||(X(G(("(p61!=1)")||(F("((p20!=1)||(p172!=1))"))))))))))
Formula 0 simplified : !X(F"((p154==1)&&(p204==1))" | (X("(p61!=1)" | F"((p20!=1)||(p172!=1))") U (("(p20!=1)" & X("(p61!=1)" | F"((p20!=1)||(p172!=1))")) | XG("(p61!=1)" | F"((p20!=1)||(p172!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t7, t19, t27, t38, t44, t56, t60, t62, t63, t74, t76, t77, t88, t93, t97, t100, t106, t108, t113, t115, t122, t126, t129, t137, t169, t170, t171, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/127/31/158
Computing Next relation with stutter on 40 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
783 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.84664,233892,1,0,283,851629,359,156,4455,1.07902e+06,337
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-02b-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-02b-07 finished in 11053 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(G(!p1)||X(X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 170 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 170 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 170 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 167 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 167 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 165 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 164 transition count 158
Applied a total of 35 rules in 11 ms. Remains 164 /180 variables (removed 16) and now considering 158/177 (removed 19) transitions.
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:33:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:10] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:33:10] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-08 09:33:10] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 164 cols
[2021-05-08 09:33:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:10] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/180 places, 158/177 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-02b-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s72 1), p1:(NEQ s17 1), p2:(NEQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 191 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-02b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-08 finished in 420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||F(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 179 transition count 120
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 66 rules applied. Total rules applied 122 place count 123 transition count 110
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 118 transition count 109
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 128 place count 118 transition count 84
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 178 place count 93 transition count 84
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 185 place count 86 transition count 77
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 86 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 192 place count 86 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 200 place count 82 transition count 73
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 256 place count 54 transition count 42
Applied a total of 256 rules in 11 ms. Remains 54 /180 variables (removed 126) and now considering 42/177 (removed 135) transitions.
// Phase 1: matrix 42 rows 54 cols
[2021-05-08 09:33:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:10] [INFO ] Implicit Places using invariants in 30 ms returned [16, 17, 20, 21, 29, 37, 53]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 30 ms to find 7 implicit places.
[2021-05-08 09:33:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 47 cols
[2021-05-08 09:33:10] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:33:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 47/180 places, 42/177 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 39
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 44 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 42 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 42 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 41 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 40 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 40 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 38 transition count 33
Applied a total of 18 rules in 3 ms. Remains 38 /47 variables (removed 9) and now considering 33/42 (removed 9) transitions.
// Phase 1: matrix 33 rows 38 cols
[2021-05-08 09:33:11] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:33:11] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 33 rows 38 cols
[2021-05-08 09:33:11] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:33:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-08 09:33:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 38/180 places, 33/177 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-09 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(EQ s36 1), p1:(EQ s35 1), p0:(EQ s0 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][true, true]]
Product exploration explored 100000 steps with 11685 reset in 108 ms.
Stack based approach found an accepted trace after 1691 steps with 197 reset with depth 5 and stack size 5 in 2 ms.
FORMULA AutoFlight-PT-02b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-09 finished in 296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 170 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 170 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 170 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 166 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 166 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 164 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 164 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 163 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 163 transition count 158
Applied a total of 36 rules in 6 ms. Remains 163 /180 variables (removed 17) and now considering 158/177 (removed 19) transitions.
// Phase 1: matrix 158 rows 163 cols
[2021-05-08 09:33:11] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:33:11] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 158 rows 163 cols
[2021-05-08 09:33:11] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:11] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 163 cols
[2021-05-08 09:33:11] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:11] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 163/180 places, 158/177 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s39 0), p0:(NEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1005 reset in 134 ms.
Product exploration explored 100000 steps with 998 reset in 146 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1005 reset in 130 ms.
Product exploration explored 100000 steps with 999 reset in 143 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 1 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 163/163 places, 158/158 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 163 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 163 transition count 156
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 52 place count 163 transition count 169
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 75 place count 163 transition count 169
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 110 place count 128 transition count 134
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 145 place count 128 transition count 134
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 185 place count 128 transition count 130
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 211 place count 102 transition count 104
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 237 place count 102 transition count 104
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 237 rules in 11 ms. Remains 102 /163 variables (removed 61) and now considering 104/158 (removed 54) transitions.
[2021-05-08 09:33:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 102 cols
[2021-05-08 09:33:12] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/163 places, 104/158 transitions.
Product exploration explored 100000 steps with 1018 reset in 137 ms.
Product exploration explored 100000 steps with 1024 reset in 151 ms.
[2021-05-08 09:33:12] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:33:12] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:33:12] [INFO ] Time to serialize gal into /tmp/LTL2898162616823962466.gal : 1 ms
[2021-05-08 09:33:12] [INFO ] Time to serialize properties into /tmp/LTL232089553746507801.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2898162616823962466.gal, -t, CGAL, -LTL, /tmp/LTL232089553746507801.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2898162616823962466.gal -t CGAL -LTL /tmp/LTL232089553746507801.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p56!=1)"))U(X(G("(p56==0)"))))))
Formula 0 simplified : !X(F"(p56!=1)" U XG"(p56==0)")
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t7, t19, t27, t38, t44, t56, t60, t62, t63, t74, t76, t77, t88, t93, t97, t100, t104, t108, t115, t122, t126, t129, t137, t170, t171, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/129/29/158
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
[2021-05-08 09:33:27] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:33:27] [INFO ] Applying decomposition
[2021-05-08 09:33:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph725730721568207648.txt, -o, /tmp/graph725730721568207648.bin, -w, /tmp/graph725730721568207648.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph725730721568207648.bin, -l, -1, -v, -w, /tmp/graph725730721568207648.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 09:33:27] [INFO ] Decomposing Gal with order
[2021-05-08 09:33:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 09:33:27] [INFO ] Removed a total of 36 redundant transitions.
[2021-05-08 09:33:27] [INFO ] Flatten gal took : 13 ms
[2021-05-08 09:33:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-08 09:33:27] [INFO ] Time to serialize gal into /tmp/LTL10615913243252619324.gal : 3 ms
[2021-05-08 09:33:27] [INFO ] Time to serialize properties into /tmp/LTL17608433475289234708.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10615913243252619324.gal, -t, CGAL, -LTL, /tmp/LTL17608433475289234708.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10615913243252619324.gal -t CGAL -LTL /tmp/LTL17608433475289234708.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i3.u15.p56!=1)"))U(X(G("(i3.u15.p56==0)"))))))
Formula 0 simplified : !X(F"(i3.u15.p56!=1)" U XG"(i3.u15.p56==0)")
Reverse transition relation is NOT exact ! Due to transitions t60, t63, t74, t77, t104, t126, t170, t171, t172, i0.u5.t0, i0.u5.t137, i1.u8.t3, i1.u8.t129, i2.t122, i2.u11.t115, i3.u16.t6, i3.u16.t108, i4.t97, i4.i1.u18.t7, i4.i1.u18.t100, i5.t93, i5.u22.t88, i7.i0.t76, i9.t62, i10.i1.t44, i10.i2.u67.t19, i12.i0.t56, i14.t38, i15.i0.u64.t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/129/29/158
Computing Next relation with stutter on 40 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
349 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.5026,148644,1,0,351897,258,2309,280730,188,818,452915
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-02b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-02b-10 finished in 20764 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 170 transition count 167
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 170 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 170 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 167 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 167 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 166 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 166 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 165 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 165 transition count 159
Applied a total of 33 rules in 6 ms. Remains 165 /180 variables (removed 15) and now considering 159/177 (removed 18) transitions.
// Phase 1: matrix 159 rows 165 cols
[2021-05-08 09:33:32] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:32] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 159 rows 165 cols
[2021-05-08 09:33:32] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:32] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 165 cols
[2021-05-08 09:33:32] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:32] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 165/180 places, 159/177 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s54 0), p2:(NEQ s70 1), p1:(NEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 178 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 165 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 165/165 places, 159/159 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 165 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 165 transition count 157
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 49 place count 165 transition count 167
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 75 place count 165 transition count 167
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 110 place count 130 transition count 132
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 145 place count 130 transition count 132
Performed 36 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 181 place count 130 transition count 128
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 204 place count 107 transition count 105
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 227 place count 107 transition count 105
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 227 rules in 10 ms. Remains 107 /165 variables (removed 58) and now considering 105/159 (removed 54) transitions.
[2021-05-08 09:33:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 105 rows 107 cols
[2021-05-08 09:33:33] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:33:33] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/165 places, 105/159 transitions.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
[2021-05-08 09:33:33] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:33:33] [INFO ] Flatten gal took : 7 ms
[2021-05-08 09:33:33] [INFO ] Time to serialize gal into /tmp/LTL12722172865699997091.gal : 1 ms
[2021-05-08 09:33:33] [INFO ] Time to serialize properties into /tmp/LTL9232501154669595330.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12722172865699997091.gal, -t, CGAL, -LTL, /tmp/LTL9232501154669595330.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12722172865699997091.gal -t CGAL -LTL /tmp/LTL9232501154669595330.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p78==0)")||(X(("(p150!=1)")||(G("(p103!=1)")))))))
Formula 0 simplified : !X("(p78==0)" | X("(p150!=1)" | G"(p103!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t7, t8, t9, t19, t27, t38, t44, t56, t60, t62, t63, t74, t76, t77, t88, t90, t97, t100, t104, t108, t115, t122, t126, t129, t137, t170, t171, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/128/31/159
Computing Next relation with stutter on 40 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
719 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.20961,219056,1,0,283,751863,338,156,4459,1.03324e+06,329
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-02b-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-02b-11 finished in 9738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||X((p2 U p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 169 transition count 166
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 169 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 169 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 165 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 165 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 163 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 163 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 162 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 162 transition count 156
Applied a total of 39 rules in 6 ms. Remains 162 /180 variables (removed 18) and now considering 156/177 (removed 21) transitions.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:41] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:41] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:41] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:41] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:41] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/180 places, 156/177 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-02b-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s79 1), p0:(EQ s129 1), p3:(AND (EQ s79 1) (EQ s152 1)), p2:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-12 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 169 transition count 166
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 169 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 169 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 165 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 165 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 163 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 163 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 162 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 162 transition count 156
Applied a total of 39 rules in 5 ms. Remains 162 /180 variables (removed 18) and now considering 156/177 (removed 21) transitions.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:42] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:42] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 162 cols
[2021-05-08 09:33:42] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 09:33:42] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/180 places, 156/177 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-13 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 179 transition count 118
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 126 place count 121 transition count 108
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 117 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 116 transition count 107
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 132 place count 116 transition count 82
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 182 place count 91 transition count 82
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 189 place count 84 transition count 75
Iterating global reduction 4 with 7 rules applied. Total rules applied 196 place count 84 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 196 place count 84 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 204 place count 80 transition count 71
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 260 place count 52 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 51 transition count 39
Reduce places removed 3 places and 0 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 4 with 4 rules applied. Total rules applied 265 place count 48 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 47 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 266 place count 47 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 270 place count 45 transition count 36
Applied a total of 270 rules in 11 ms. Remains 45 /180 variables (removed 135) and now considering 36/177 (removed 141) transitions.
// Phase 1: matrix 36 rows 45 cols
[2021-05-08 09:33:42] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants in 23 ms returned [16, 24, 38, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
[2021-05-08 09:33:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 36 rows 41 cols
[2021-05-08 09:33:42] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-08 09:33:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 41/180 places, 36/177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 39 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 38 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 38 transition count 33
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 35 transition count 30
Applied a total of 12 rules in 2 ms. Remains 35 /41 variables (removed 6) and now considering 30/36 (removed 6) transitions.
// Phase 1: matrix 30 rows 35 cols
[2021-05-08 09:33:42] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 30 rows 35 cols
[2021-05-08 09:33:42] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/180 places, 30/177 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7067 reset in 96 ms.
Product exploration explored 100000 steps with 7067 reset in 108 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7075 reset in 100 ms.
Stack based approach found an accepted trace after 79260 steps with 5594 reset with depth 11 and stack size 11 in 85 ms.
FORMULA AutoFlight-PT-02b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-14 finished in 598 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 179 transition count 117
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 127 place count 120 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 116 transition count 108
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 131 place count 116 transition count 84
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 179 place count 92 transition count 84
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 86 transition count 78
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 86 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 191 place count 86 transition count 75
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 197 place count 83 transition count 75
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 257 place count 53 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 52 transition count 41
Reduce places removed 3 places and 0 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 3 with 4 rules applied. Total rules applied 262 place count 49 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 48 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 263 place count 48 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 267 place count 46 transition count 38
Applied a total of 267 rules in 9 ms. Remains 46 /180 variables (removed 134) and now considering 38/177 (removed 139) transitions.
// Phase 1: matrix 38 rows 46 cols
[2021-05-08 09:33:42] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants in 32 ms returned [19, 27, 35, 39, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 32 ms to find 5 implicit places.
[2021-05-08 09:33:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 41 cols
[2021-05-08 09:33:42] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 41/180 places, 38/177 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 38 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 38 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 33
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 12 place count 35 transition count 32
Applied a total of 12 rules in 2 ms. Remains 35 /41 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 35 cols
[2021-05-08 09:33:42] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 32 rows 35 cols
[2021-05-08 09:33:42] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:33:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/180 places, 32/177 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-15 automaton TGBA [mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s13 1), p1:(EQ s3 1), p0:(AND (EQ s14 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-15 finished in 241 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620466424131

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-02b, 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-tall-162037989900394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b execution
cd execution
if [ "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 ;