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

About the Execution of ITS-Tools for AirplaneLD-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
380.228 11367.00 23724.00 310.60 FFTFFTTFTFFTTFFF 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-162037989800266.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 AirplaneLD-PT-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989800266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 459K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 207K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 25K Mar 28 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 28 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Mar 28 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 28 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Mar 23 01:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 23 01:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 22 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 131K Mar 22 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 796K 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 AirplaneLD-PT-0100-00
FORMULA_NAME AirplaneLD-PT-0100-01
FORMULA_NAME AirplaneLD-PT-0100-02
FORMULA_NAME AirplaneLD-PT-0100-03
FORMULA_NAME AirplaneLD-PT-0100-04
FORMULA_NAME AirplaneLD-PT-0100-05
FORMULA_NAME AirplaneLD-PT-0100-06
FORMULA_NAME AirplaneLD-PT-0100-07
FORMULA_NAME AirplaneLD-PT-0100-08
FORMULA_NAME AirplaneLD-PT-0100-09
FORMULA_NAME AirplaneLD-PT-0100-10
FORMULA_NAME AirplaneLD-PT-0100-11
FORMULA_NAME AirplaneLD-PT-0100-12
FORMULA_NAME AirplaneLD-PT-0100-13
FORMULA_NAME AirplaneLD-PT-0100-14
FORMULA_NAME AirplaneLD-PT-0100-15

=== Now, execution of the tool begins

BK_START 1620455558642

Running Version 0
[2021-05-08 06:32:40] [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 06:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 06:32:40] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2021-05-08 06:32:40] [INFO ] Transformed 719 places.
[2021-05-08 06:32:40] [INFO ] Transformed 808 transitions.
[2021-05-08 06:32:40] [INFO ] Found NUPN structural information;
[2021-05-08 06:32:40] [INFO ] Parsed PT model containing 719 places and 808 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 06:32:40] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 302 places and 0 transitions.
FORMULA AirplaneLD-PT-0100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 262 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 414 transition count 808
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 149 place count 268 transition count 662
Iterating global reduction 1 with 146 rules applied. Total rules applied 295 place count 268 transition count 662
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 441 place count 268 transition count 516
Applied a total of 441 rules in 35 ms. Remains 268 /417 variables (removed 149) and now considering 516/808 (removed 292) transitions.
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 06:32:40] [INFO ] Computed 1 place invariants in 36 ms
[2021-05-08 06:32:40] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 06:32:40] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-08 06:32:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 06:32:41] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-08 06:32:41] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/417 places, 516/808 transitions.
[2021-05-08 06:32:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 06:32:41] [INFO ] Flatten gal took : 67 ms
FORMULA AirplaneLD-PT-0100-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 06:32:41] [INFO ] Flatten gal took : 33 ms
[2021-05-08 06:32:41] [INFO ] Input system was already deterministic with 516 transitions.
Incomplete random walk after 100000 steps, including 12313 resets, run finished after 979 ms. (steps per millisecond=102 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 06:32:42] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-08 06:32:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 06:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 06:32:43] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 06:32:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 06:32:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 06:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 06:32:43] [INFO ] [Nat]Absence check using state equation in 103 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-08 06:32:43] [INFO ] Initial state test concluded for 1 properties.
FORMULA AirplaneLD-PT-0100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(X(G(p0))))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 51 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 67 transition count 315
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 67 transition count 315
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 0 with 201 rules applied. Total rules applied 603 place count 67 transition count 114
Applied a total of 603 rules in 7 ms. Remains 67 /268 variables (removed 201) and now considering 114/516 (removed 402) transitions.
// Phase 1: matrix 114 rows 67 cols
[2021-05-08 06:32:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:43] [INFO ] Implicit Places using invariants in 25 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:43] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:43] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 66/268 places, 114/516 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:43] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-08 06:32:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0100-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(EQ s65 1), p0:(OR (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s8 1) (EQ s29 1)) (AND (EQ s8 1) (EQ s31 1)) (AND (EQ s8 1) (EQ s33 1)) (AND (EQ s8 1) (EQ s19 1)) (AND (EQ s8 1) (EQ s21 1)) (AND (EQ s8 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s25 1)) (AND (EQ s8 1) (EQ s43 1)) (AND (EQ s8 1) (EQ s45 1)) (AND (EQ s8 1) (EQ s47 1)) (AND (EQ s8 1) (EQ s49 1)) (AND (EQ s8 1) (EQ s35 1)) (AND (EQ s8 1) (EQ s37 1)) (AND (EQ s8 1) (EQ s39 1)) (AND (EQ s8 1) (EQ s41 1)) (AND (EQ s8 1) (EQ s51 1)) (AND (EQ s8 1) (EQ s53 1)) (AND (EQ s8 1) (EQ s55 1)) (AND (EQ s8 1) (EQ s57 1)) (AND (EQ s8 1) (EQ s12 1)) (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s8 1) (EQ s16 1)) (AND (EQ s8 1) (EQ s18 1)) (AND (EQ s8 1) (EQ s10 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s8 1) (EQ s30 1)) (AND (EQ s8 1) (EQ s32 1)) (AND (EQ s8 1) (EQ s34 1)) (AND (EQ s8 1) (EQ s20 1)) (AND (EQ s8 1) (EQ s22 1)) (AND (EQ s8 1) (EQ s24 1)) (AND (EQ s8 1) (EQ s26 1)) (AND (EQ s8 1) (EQ s44 1)) (AND (EQ s8 1) (EQ s46 1)) (AND (EQ s8 1) (EQ s48 1)) (AND (EQ s8 1) (EQ s50 1)) (AND (EQ s8 1) (EQ s36 1)) (AND (EQ s8 1) (EQ s38 1)) (AND (EQ s8 1) (EQ s40 1)) (AND (EQ s8 1) (EQ s42 1)) (AND (EQ s8 1) (EQ s52 1)) (AND (EQ s8 1) (EQ s54 1)) (AND (EQ s8 1) (EQ s56 1)) (AND (EQ s8 1) (EQ s58 1)) (AND (EQ s8 1) (EQ s11 1)) (AND (EQ s8 1) (EQ s13 1)) (AND (EQ s8 1) (EQ s15 1)) (AND (EQ s8 1) (EQ s17 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, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-01 finished in 527 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0 U p1))&&F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 103 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 119 transition count 367
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 119 transition count 367
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 0 with 149 rules applied. Total rules applied 447 place count 119 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 447 place count 119 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 449 place count 118 transition count 217
Applied a total of 449 rules in 19 ms. Remains 118 /268 variables (removed 150) and now considering 217/516 (removed 299) transitions.
// Phase 1: matrix 217 rows 118 cols
[2021-05-08 06:32:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:43] [INFO ] Implicit Places using invariants in 28 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
[2021-05-08 06:32:43] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 217 rows 117 cols
[2021-05-08 06:32:43] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-08 06:32:44] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 117/268 places, 217/516 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 215
Applied a total of 4 rules in 6 ms. Remains 115 /117 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 115 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 215 rows 115 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 15 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 129 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 114/268 places, 215/516 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 113 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 112 transition count 213
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 112 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 112 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 112 transition count 211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 111 transition count 211
Applied a total of 7 rules in 15 ms. Remains 111 /114 variables (removed 3) and now considering 211/215 (removed 4) transitions.
// Phase 1: matrix 211 rows 111 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 211 rows 111 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 110/268 places, 211/516 transitions.
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 2 place count 109 transition count 210
Applied a total of 2 rules in 7 ms. Remains 109 /110 variables (removed 1) and now considering 210/211 (removed 1) transitions.
// Phase 1: matrix 210 rows 109 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 210 rows 109 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 109/268 places, 210/516 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s107 1), p0:(OR (AND (EQ s3 1) (EQ s35 1)) (AND (EQ s3 1) (EQ s100 1)) (AND (EQ s3 1) (EQ s31 1)) (AND (EQ s3 1) (EQ s96 1)) (AND (EQ s3 1) (EQ s43 1)) (AND (EQ s3 1) (EQ s39 1)) (AND (EQ s3 1) (EQ s104 1)) (AND (EQ s3 1) (EQ s19 1)) (AND (EQ s3 1) (EQ s84 1)) (AND (EQ s3 1) (EQ s15 1)) (AND (EQ s3 1) (EQ s80 1)) (AND (EQ s3 1) (EQ s27 1)) (AND (EQ s3 1) (EQ s92 1)) (AND (EQ s3 1) (EQ s23 1)) (AND (EQ s3 1) (EQ s88 1)) (AND (EQ s3 1) (EQ s68 1)) (AND (EQ s3 1) (EQ s64 1)) (AND (EQ s3 1) (EQ s11 1)) (AND (EQ s3 1) (EQ s76 1)) (AND (EQ s3 1) (EQ s7 1)) (AND (EQ s3 1) (EQ s72 1)) (AND (EQ s3 1) (EQ s52 1)) (AND (EQ s3 1) (EQ s48 1)) (AND (EQ s3 1) (EQ s60 1)) (AND (EQ s3 1) (EQ s56 1)) (AND (EQ s3 1) (EQ s38 1)) (AND (EQ s3 1) (EQ s99 1)) (AND (EQ s3 1) (EQ s34 1)) (AND (EQ s3 1) (EQ s95 1)) (AND (EQ s3 1) (EQ s46 1)) (AND (EQ s3 1) (EQ s42 1)) (AND (EQ s3 1) (EQ s103 1)) (AND (EQ s3 1) (EQ s22 1)) (AND (EQ s3 1) (EQ s83 1)) (AND (EQ s3 1) (EQ s18 1)) (AND (EQ s3 1) (EQ s79 1)) (AND (EQ s3 1) (EQ s30 1)) (AND (EQ s3 1) (EQ s91 1)) (AND (EQ s3 1) (EQ s26 1)) (AND (EQ s3 1) (EQ s87 1)) (AND (EQ s3 1) (EQ s6 1)) (AND (EQ s3 1) (EQ s67 1)) (AND (EQ s3 1) (EQ s63 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (EQ s3 1) (EQ s75 1)) (AND (EQ s3 1) (EQ s10 1)) (AND (EQ s3 1) (EQ s71 1)) (AND (EQ s3 1) (EQ s51 1)) (AND (EQ s3 1) (EQ s47 1)) (AND (EQ s3 1) (EQ s59 1)) (AND (EQ s3 1) (EQ s55 1)) (AND (EQ s3 1) (EQ s37 1)) (AND (EQ s3 1) (EQ s102 1)) (AND (EQ s3 1) (EQ s33 1)) (AND (EQ s3 1) (EQ s98 1)) (AND (EQ s3 1) (EQ s45 1)) (AND (EQ s3 1) (EQ s41 1)) (AND (EQ s3 1) (EQ s86 1)) (AND (EQ s3 1) (EQ s21 1)) (AND (EQ s3 1) (EQ s82 1)) (AND (EQ s3 1) (EQ s17 1)) (AND (EQ s3 1) (EQ s29 1)) (AND (EQ s3 1) (EQ s94 1)) (AND (EQ s3 1) (EQ s25 1)) (AND (EQ s3 1) (EQ s90 1)) (AND (EQ s3 1) (EQ s70 1)) (AND (EQ s3 1) (EQ s5 1)) (AND (EQ s3 1) (EQ s66 1)) (AND (EQ s3 1) (EQ s78 1)) (AND (EQ s3 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s74 1)) (AND (EQ s3 1) (EQ s9 1)) (AND (EQ s3 1) (EQ s54 1)) (AND (EQ s3 1) (EQ s50 1)) (AND (EQ s3 1) (EQ s62 1)) (AND (EQ s3 1) (EQ s58 1)) (AND (EQ s3 1) (EQ s101 1)) (AND (EQ s3 1) (EQ s36 1)) (AND (EQ s3 1) (EQ s97 1)) (AND (EQ s3 1) (EQ s32 1)) (AND (EQ s3 1) (EQ s44 1)) (AND (EQ s3 1) (EQ s105 1)) (AND (EQ s3 1) (EQ s40 1)) (AND (EQ s3 1) (EQ s20 1)) (AND (EQ s3 1) (EQ s85 1)) (AND (EQ s3 1) (EQ s16 1)) (AND (EQ s3 1) (EQ s81 1)) (AND (EQ s3 1) (EQ s93 1)) (AND (EQ s3 1) (EQ s28 1)) (AND (EQ s3 1) (EQ s89 1)) (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s3 1) (EQ s69 1)) (AND (EQ s3 1) (EQ s65 1)) (AND (EQ s3 1) (EQ s12 1)) (AND (EQ s3 1) (EQ s77 1)) (AND (EQ s3 1) (EQ s8 1)) (AND (EQ s3 1) (EQ s73 1)) (AND (EQ s3 1) (EQ s53 1)) (AND (EQ s3 1) (EQ s49 1)) (AND (EQ s3 1) (EQ s61 1)) (AND (EQ s3 1) (EQ s57 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-03 finished in 621 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 249 places :
Symmetric choice reduction at 0 with 249 rule applications. Total rules 249 place count 19 transition count 267
Iterating global reduction 0 with 249 rules applied. Total rules applied 498 place count 19 transition count 267
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 0 with 249 rules applied. Total rules applied 747 place count 19 transition count 18
Applied a total of 747 rules in 10 ms. Remains 19 /268 variables (removed 249) and now considering 18/516 (removed 498) transitions.
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 06:32:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants in 14 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 18/268 places, 18/516 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:44] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/268 places, 18/516 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-0100-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s15 0), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-04 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0&&X((!p0 U ((p1 U G(p2))||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 52 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 67 transition count 315
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 67 transition count 315
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 0 with 201 rules applied. Total rules applied 603 place count 67 transition count 114
Applied a total of 603 rules in 5 ms. Remains 67 /268 variables (removed 201) and now considering 114/516 (removed 402) transitions.
// Phase 1: matrix 114 rows 67 cols
[2021-05-08 06:32:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:44] [INFO ] Implicit Places using invariants in 18 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 66/268 places, 114/516 transitions.
Applied a total of 0 rules in 0 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:44] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:44] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0100-05 automaton TGBA [mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s62 1), p2:(EQ s61 1), p1:(AND (OR (EQ s8 0) (EQ s27 0)) (OR (EQ s8 0) (EQ s29 0)) (OR (EQ s8 0) (EQ s31 0)) (OR (EQ s8 0) (EQ s33 0)) (OR (EQ s8 0) (EQ s19 0)) (OR (EQ s8 0) (EQ s21 0)) (OR (EQ s8 0) (EQ s23 0)) (OR (EQ s8 0) (EQ s25 0)) (OR (EQ s8 0) (EQ s43 0)) (OR (EQ s8 0) (EQ s45 0)) (OR (EQ s8 0) (EQ s47 0)) (OR (EQ s8 0) (EQ s49 0)) (OR (EQ s8 0) (EQ s35 0)) (OR (EQ s8 0) (EQ s37 0)) (OR (EQ s8 0) (EQ s39 0)) (OR (EQ s8 0) (EQ s41 0)) (OR (EQ s8 0) (EQ s51 0)) (OR (EQ s8 0) (EQ s53 0)) (OR (EQ s8 0) (EQ s55 0)) (OR (EQ s8 0) (EQ s57 0)) (OR (EQ s8 0) (EQ s12 0)) (OR (EQ s8 0) (EQ s14 0)) (OR (EQ s8 0) (EQ s16 0)) (OR (EQ s8 0) (EQ s18 0)) (OR (EQ s8 0) (EQ s10 0)) (OR (EQ s8 0) (EQ s28 0)) (OR (EQ s8 0) (EQ s30 0)) (OR (EQ s8 0) (EQ s32 0)) (OR (EQ s8 0) (EQ s34 0)) (OR (EQ s8 0) (EQ s20 0)) (OR (EQ s8 0) (EQ s22 0)) (OR (EQ s8 0) (EQ s24 0)) (OR (EQ s8 0) (EQ s26 0)) (OR (EQ s8 0) (EQ s44 0)) (OR (EQ s8 0) (EQ s46 0)) (OR (EQ s8 0) (EQ s48 0)) (OR (EQ s8 0) (EQ s50 0)) (OR (EQ s8 0) (EQ s36 0)) (OR (EQ s8 0) (EQ s38 0)) (OR (EQ s8 0) (EQ s40 0)) (OR (EQ s8 0) (EQ s42 0)) (OR (EQ s8 0) (EQ s52 0)) (OR (EQ s8 0) (EQ s54 0)) (OR (EQ s8 0) (EQ s56 0)) (OR (EQ s8 0) (EQ s58 0)) (OR (EQ s8 0) (EQ s11 0)) (OR (EQ s8 0) (EQ s13 0)) (OR (EQ s8 0) (EQ s15 0)) (OR (EQ s8 0) (EQ s17 0)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12686 reset in 364 ms.
Product exploration explored 100000 steps with 12690 reset in 252 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p2))), (F (G p1)), p0, p2, p1]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA AirplaneLD-PT-0100-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-PT-0100-05 finished in 933 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)&&F(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 51 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 67 transition count 315
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 67 transition count 315
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 0 with 201 rules applied. Total rules applied 603 place count 67 transition count 114
Applied a total of 603 rules in 5 ms. Remains 67 /268 variables (removed 201) and now considering 114/516 (removed 402) transitions.
// Phase 1: matrix 114 rows 67 cols
[2021-05-08 06:32:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:45] [INFO ] Implicit Places using invariants in 16 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 66/268 places, 114/516 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 06:32:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:45] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR p0 p1), (OR p0 p1), true, p1]
Running random walk in product with property : AirplaneLD-PT-0100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s8 1) (EQ s29 1)) (AND (EQ s8 1) (EQ s31 1)) (AND (EQ s8 1) (EQ s33 1)) (AND (EQ s8 1) (EQ s19 1)) (AND (EQ s8 1) (EQ s21 1)) (AND (EQ s8 1) (EQ s23 1)) (AND (EQ s8 1) (EQ s25 1)) (AND (EQ s8 1) (EQ s43 1)) (AND (EQ s8 1) (EQ s45 1)) (AND (EQ s8 1) (EQ s47 1)) (AND (EQ s8 1) (EQ s49 1)) (AND (EQ s8 1) (EQ s35 1)) (AND (EQ s8 1) (EQ s37 1)) (AND (EQ s8 1) (EQ s39 1)) (AND (EQ s8 1) (EQ s41 1)) (AND (EQ s8 1) (EQ s51 1)) (AND (EQ s8 1) (EQ s53 1)) (AND (EQ s8 1) (EQ s55 1)) (AND (EQ s8 1) (EQ s57 1)) (AND (EQ s8 1) (EQ s12 1)) (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s8 1) (EQ s16 1)) (AND (EQ s8 1) (EQ s18 1)) (AND (EQ s8 1) (EQ s10 1)) (AND (EQ s8 1) (EQ s28 1)) (AND (EQ s8 1) (EQ s30 1)) (AND (EQ s8 1) (EQ s32 1)) (AND (EQ s8 1) (EQ s34 1)) (AND (EQ s8 1) (EQ s20 1)) (AND (EQ s8 1) (EQ s22 1)) (AND (EQ s8 1) (EQ s24 1)) (AND (EQ s8 1) (EQ s26 1)) (AND (EQ s8 1) (EQ s44 1)) (AND (EQ s8 1) (EQ s46 1)) (AND (EQ s8 1) (EQ s48 1)) (AND (EQ s8 1) (EQ s50 1)) (AND (EQ s8 1) (EQ s36 1)) (AND (EQ s8 1) (EQ s38 1)) (AND (EQ s8 1) (EQ s40 1)) (AND (EQ s8 1) (EQ s42 1)) (AND (EQ s8 1) (EQ s52 1)) (AND (EQ s8 1) (EQ s54 1)) (AND (EQ s8 1) (EQ s56 1)) (AND (EQ s8 1) (EQ s58 1)) (AND (EQ s8 1) (EQ s11 1)) (AND (EQ s8 1) (EQ s13 1)) (AND (EQ s8 1) (EQ s15 1)) (AND (EQ s8 1) (EQ s17 1))), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 14 reset in 1 ms.
FORMULA AirplaneLD-PT-0100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-07 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 20 transition count 268
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 20 transition count 268
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 20 transition count 20
Applied a total of 744 rules in 4 ms. Remains 20 /268 variables (removed 248) and now considering 20/516 (removed 496) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-08 06:32:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:45] [INFO ] Implicit Places using invariants in 14 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 20 rows 19 cols
[2021-05-08 06:32:45] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 19/268 places, 20/516 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 19 cols
[2021-05-08 06:32:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/268 places, 20/516 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s13 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA AirplaneLD-PT-0100-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-PT-0100-08 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 20 transition count 268
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 20 transition count 268
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 744 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 746 place count 19 transition count 19
Applied a total of 746 rules in 10 ms. Remains 19 /268 variables (removed 249) and now considering 19/516 (removed 497) transitions.
// Phase 1: matrix 19 rows 19 cols
[2021-05-08 06:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 13 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
[2021-05-08 06:32:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 18/268 places, 19/516 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 17
Applied a total of 4 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 15/268 places, 17/516 transitions.
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 2 place count 14 transition count 16
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 13 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 13 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 13 transition count 14
Applied a total of 5 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 13/268 places, 14/516 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-09 finished in 144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 20 transition count 268
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 20 transition count 268
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 744 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 746 place count 19 transition count 19
Applied a total of 746 rules in 8 ms. Remains 19 /268 variables (removed 249) and now considering 19/516 (removed 497) transitions.
// Phase 1: matrix 19 rows 19 cols
[2021-05-08 06:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 13 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-08 06:32:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 18/268 places, 19/516 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 17
Applied a total of 4 rules in 1 ms. Remains 16 /18 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 39 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 15/268 places, 17/516 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 13 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 13 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 13 transition count 14
Applied a total of 5 rules in 3 ms. Remains 13 /15 variables (removed 2) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 13/268 places, 14/516 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-10 finished in 139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X((!p0 U (p1||G(!p0))))||(X(p2) U ((p3&&X(p2))||X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 20 transition count 268
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 20 transition count 268
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 20 transition count 20
Applied a total of 744 rules in 4 ms. Remains 20 /268 variables (removed 248) and now considering 20/516 (removed 496) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-08 06:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Implicit Places using invariants in 11 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 20 rows 19 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 19/268 places, 20/516 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 19 cols
[2021-05-08 06:32:46] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/268 places, 20/516 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND p0 (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 2}, { cond=(AND p3 p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (NEQ s8 1) (NEQ s10 1)), p2:(NEQ s18 0), p0:(EQ s18 1), p1:(AND (NEQ s16 1) (NEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12558 reset in 146 ms.
Product exploration explored 100000 steps with 12557 reset in 184 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p3)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1)), p3, p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 263 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 12539 reset in 147 ms.
Product exploration explored 100000 steps with 12584 reset in 166 ms.
[2021-05-08 06:32:48] [INFO ] Flatten gal took : 2 ms
[2021-05-08 06:32:48] [INFO ] Flatten gal took : 2 ms
[2021-05-08 06:32:48] [INFO ] Time to serialize gal into /tmp/LTL4474899001770161341.gal : 1 ms
[2021-05-08 06:32:48] [INFO ] Time to serialize properties into /tmp/LTL14166392351862272153.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/LTL4474899001770161341.gal, -t, CGAL, -LTL, /tmp/LTL14166392351862272153.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/LTL4474899001770161341.gal -t CGAL -LTL /tmp/LTL14166392351862272153.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((X(("(stp4!=1)")U(("((stp3!=1)&&(stp4!=1))")||(G("(stp4!=1)")))))||((X("(stp4!=0)"))U((("((P4!=1)||(Speed_Left_Wheel_19!=1))")&&(X("(stp4!=0)")))||(X(G("(stp4!=0)")))))))))
Formula 0 simplified : !XG(X("(stp4!=1)" U ("((stp3!=1)&&(stp4!=1))" | G"(stp4!=1)")) | (X"(stp4!=0)" U (("((P4!=1)||(Speed_Left_Wheel_19!=1))" & X"(stp4!=0)") | XG"(stp4!=0)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t106, t207, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/5/20
Computing Next relation with stutter on 23 deadlock states
27 unique states visited
0 strongly connected components in search stack
49 transitions explored
11 items max in DFS search stack
2 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,0.044022,19260,1,0,157,4627,123,140,551,8017,478
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AirplaneLD-PT-0100-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AirplaneLD-PT-0100-12 finished in 1830 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||G((F(G(p1))&&F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 247 places :
Symmetric choice reduction at 0 with 247 rule applications. Total rules 247 place count 21 transition count 269
Iterating global reduction 0 with 247 rules applied. Total rules applied 494 place count 21 transition count 269
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Iterating post reduction 0 with 247 rules applied. Total rules applied 741 place count 21 transition count 22
Applied a total of 741 rules in 5 ms. Remains 21 /268 variables (removed 247) and now considering 22/516 (removed 494) transitions.
// Phase 1: matrix 22 rows 21 cols
[2021-05-08 06:32:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2021-05-08 06:32:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 21 cols
[2021-05-08 06:32:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:32:48] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/268 places, 22/516 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s2 1)), p1:(AND (EQ s9 1) (EQ s11 1)), p2:(OR (NEQ s9 1) (NEQ s13 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 21 steps with 4 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-13 finished in 218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||(!p1 U p2)) U G(p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 20 transition count 268
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 20 transition count 268
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 744 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 744 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 746 place count 19 transition count 19
Applied a total of 746 rules in 9 ms. Remains 19 /268 variables (removed 249) and now considering 19/516 (removed 497) transitions.
// Phase 1: matrix 19 rows 19 cols
[2021-05-08 06:32:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants in 23 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
[2021-05-08 06:32:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2021-05-08 06:32:48] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:32:48] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 18/268 places, 19/516 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 17
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 17 rows 16 cols
[2021-05-08 06:32:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants and state equation in 14 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 37 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 15/268 places, 17/516 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 13 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 13 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 13 transition count 14
Applied a total of 5 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-08 06:32:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:32:48] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 13/268 places, 14/516 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p3), true, (NOT p2), (NOT p3), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : AirplaneLD-PT-0100-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 p0) (AND p3 p2) (AND p3 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s9 1), p0:(AND (EQ s3 1) (EQ s6 1)), p2:(EQ s12 1), p1:(NEQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-14 finished in 258 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620455570009

--------------------
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="AirplaneLD-PT-0100"
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 AirplaneLD-PT-0100, 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-162037989800266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0100.tgz
mv AirplaneLD-PT-0100 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 ;