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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.271 9815.00 19896.00 185.00 FFTFFTTFTFTFFFTF 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-162037989700194.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-COL-0100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989700194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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 3.4K Mar 28 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 01:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 52K 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-COL-0100-00
FORMULA_NAME AirplaneLD-COL-0100-01
FORMULA_NAME AirplaneLD-COL-0100-02
FORMULA_NAME AirplaneLD-COL-0100-03
FORMULA_NAME AirplaneLD-COL-0100-04
FORMULA_NAME AirplaneLD-COL-0100-05
FORMULA_NAME AirplaneLD-COL-0100-06
FORMULA_NAME AirplaneLD-COL-0100-07
FORMULA_NAME AirplaneLD-COL-0100-08
FORMULA_NAME AirplaneLD-COL-0100-09
FORMULA_NAME AirplaneLD-COL-0100-10
FORMULA_NAME AirplaneLD-COL-0100-11
FORMULA_NAME AirplaneLD-COL-0100-12
FORMULA_NAME AirplaneLD-COL-0100-13
FORMULA_NAME AirplaneLD-COL-0100-14
FORMULA_NAME AirplaneLD-COL-0100-15

=== Now, execution of the tool begins

BK_START 1620451045198

Running Version 0
[2021-05-08 05:17:26] [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 05:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 05:17:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-08 05:17:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-08 05:17:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2021-05-08 05:17:27] [INFO ] Detected 3 constant HL places corresponding to 302 PT places.
[2021-05-08 05:17:27] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 719 PT places and 1212.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA AirplaneLD-COL-0100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 05:17:27] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions in 4 ms.
[2021-05-08 05:17:27] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12156403079295622713.dot
[2021-05-08 05:17:27] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA AirplaneLD-COL-0100-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2021-05-08 05:17:27] [INFO ] Flatten gal took : 19 ms
[2021-05-08 05:17:27] [INFO ] Flatten gal took : 3 ms
[2021-05-08 05:17:27] [INFO ] Unfolded HLPN to a Petri net with 719 places and 808 transitions in 11 ms.
[2021-05-08 05:17:27] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13338870286608859980.dot
[2021-05-08 05:17:27] [INFO ] Reduced 99 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 99 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 199 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 199 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 199 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Reduced 99 identical enabling conditions.
[2021-05-08 05:17:27] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 302 places and 0 transitions.
FORMULA AirplaneLD-COL-0100-12 FALSE 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 29 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 05:17:27] [INFO ] Computed 1 place invariants in 37 ms
[2021-05-08 05:17:27] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 05:17:27] [INFO ] Computed 1 place invariants in 16 ms
[2021-05-08 05:17:28] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 05:17:28] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-08 05:17:28] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 268/417 places, 516/808 transitions.
[2021-05-08 05:17:28] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 05:17:28] [INFO ] Flatten gal took : 47 ms
FORMULA AirplaneLD-COL-0100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 05:17:28] [INFO ] Flatten gal took : 41 ms
[2021-05-08 05:17:28] [INFO ] Input system was already deterministic with 516 transitions.
Incomplete random walk after 100000 steps, including 12324 resets, run finished after 1051 ms. (steps per millisecond=95 ) properties (out of 10) seen :9
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 268 cols
[2021-05-08 05:17:29] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-08 05:17:29] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 05:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 05:17:29] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-08 05:17:29] [INFO ] Initial state test concluded for 1 properties.
FORMULA AirplaneLD-COL-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 18 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 05:17:29] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:29] [INFO ] Implicit Places using invariants in 22 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 05:17:29] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:29] [INFO ] Dead Transitions using invariants and state equation in 41 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 05:17:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 280 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-COL-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:(GEQ s1 1), p0:(OR (AND (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s6 1) (GEQ s54 1)) (AND (GEQ s6 1) (GEQ s60 1)) (AND (GEQ s6 1) (GEQ s58 1)) (AND (GEQ s6 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s62 1)) (AND (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s38 1)) (AND (GEQ s6 1) (GEQ s44 1)) (AND (GEQ s6 1) (GEQ s42 1)) (AND (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s6 1) (GEQ s46 1)) (AND (GEQ s6 1) (GEQ s52 1)) (AND (GEQ s6 1) (GEQ s50 1)) (AND (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s6 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1)) (AND (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s6 1) (GEQ s30 1)) (AND (GEQ s6 1) (GEQ s36 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s18 1)) (AND (GEQ s6 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s55 1)) (AND (GEQ s6 1) (GEQ s53 1)) (AND (GEQ s6 1) (GEQ s59 1)) (AND (GEQ s6 1) (GEQ s57 1)) (AND (GEQ s6 1) (GEQ s63 1)) (AND (GEQ s6 1) (GEQ s61 1)) (AND (GEQ s6 1) (GEQ s39 1)) (AND (GEQ s6 1) (GEQ s37 1)) (AND (GEQ s6 1) (GEQ s43 1)) (AND (GEQ s6 1) (GEQ s41 1)) (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s6 1) (GEQ s45 1)) (AND (GEQ s6 1) (GEQ s51 1)) (AND (GEQ s6 1) (GEQ s49 1)) (AND (GEQ s6 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s27 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s29 1)) (AND (GEQ s6 1) (GEQ s35 1)) (AND (GEQ s6 1) (GEQ s33 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s19 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 6 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-COL-0100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-01 finished in 449 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 20 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 05:17:30] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants in 26 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
[2021-05-08 05:17:30] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 217 rows 117 cols
[2021-05-08 05:17:30] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 05:17:30] [INFO ] Dead Transitions using invariants and state equation in 87 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 7 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 05:17:30] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 215 rows 115 cols
[2021-05-08 05:17:30] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 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 0 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 12 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 05:17:30] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 211 rows 111 cols
[2021-05-08 05:17:30] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 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 1 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 4 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 05:17:30] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 210 rows 109 cols
[2021-05-08 05:17:30] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 102 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 85 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-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:(GEQ s1 1), p0:(OR (AND (GEQ s3 1) (GEQ s18 1)) (AND (GEQ s3 1) (GEQ s79 1)) (AND (GEQ s3 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s75 1)) (AND (GEQ s3 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ s71 1)) (AND (GEQ s3 1) (GEQ s67 1)) (AND (GEQ s3 1) (GEQ s63 1)) (AND (GEQ s3 1) (GEQ s59 1)) (AND (GEQ s3 1) (GEQ s55 1)) (AND (GEQ s3 1) (GEQ s51 1)) (AND (GEQ s3 1) (GEQ s47 1)) (AND (GEQ s3 1) (GEQ s43 1)) (AND (GEQ s3 1) (GEQ s108 1)) (AND (GEQ s3 1) (GEQ s39 1)) (AND (GEQ s3 1) (GEQ s104 1)) (AND (GEQ s3 1) (GEQ s35 1)) (AND (GEQ s3 1) (GEQ s100 1)) (AND (GEQ s3 1) (GEQ s31 1)) (AND (GEQ s3 1) (GEQ s96 1)) (AND (GEQ s3 1) (GEQ s27 1)) (AND (GEQ s3 1) (GEQ s92 1)) (AND (GEQ s3 1) (GEQ s23 1)) (AND (GEQ s3 1) (GEQ s88 1)) (AND (GEQ s3 1) (GEQ s19 1)) (AND (GEQ s3 1) (GEQ s84 1)) (AND (GEQ s3 1) (GEQ s82 1)) (AND (GEQ s3 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s78 1)) (AND (GEQ s3 1) (GEQ s13 1)) (AND (GEQ s3 1) (GEQ s74 1)) (AND (GEQ s3 1) (GEQ s9 1)) (AND (GEQ s3 1) (GEQ s70 1)) (AND (GEQ s3 1) (GEQ s66 1)) (AND (GEQ s3 1) (GEQ s62 1)) (AND (GEQ s3 1) (GEQ s58 1)) (AND (GEQ s3 1) (GEQ s54 1)) (AND (GEQ s3 1) (GEQ s50 1)) (AND (GEQ s3 1) (GEQ s46 1)) (AND (GEQ s3 1) (GEQ s107 1)) (AND (GEQ s3 1) (GEQ s42 1)) (AND (GEQ s3 1) (GEQ s103 1)) (AND (GEQ s3 1) (GEQ s38 1)) (AND (GEQ s3 1) (GEQ s99 1)) (AND (GEQ s3 1) (GEQ s34 1)) (AND (GEQ s3 1) (GEQ s95 1)) (AND (GEQ s3 1) (GEQ s30 1)) (AND (GEQ s3 1) (GEQ s91 1)) (AND (GEQ s3 1) (GEQ s26 1)) (AND (GEQ s3 1) (GEQ s87 1)) (AND (GEQ s3 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s83 1)) (AND (GEQ s3 1) (GEQ s16 1)) (AND (GEQ s3 1) (GEQ s81 1)) (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s3 1) (GEQ s77 1)) (AND (GEQ s3 1) (GEQ s8 1)) (AND (GEQ s3 1) (GEQ s73 1)) (AND (GEQ s3 1) (GEQ s69 1)) (AND (GEQ s3 1) (GEQ s65 1)) (AND (GEQ s3 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ s57 1)) (AND (GEQ s3 1) (GEQ s53 1)) (AND (GEQ s3 1) (GEQ s49 1)) (AND (GEQ s3 1) (GEQ s45 1)) (AND (GEQ s3 1) (GEQ s41 1)) (AND (GEQ s3 1) (GEQ s106 1)) (AND (GEQ s3 1) (GEQ s37 1)) (AND (GEQ s3 1) (GEQ s102 1)) (AND (GEQ s3 1) (GEQ s33 1)) (AND (GEQ s3 1) (GEQ s98 1)) (AND (GEQ s3 1) (GEQ s29 1)) (AND (GEQ s3 1) (GEQ s94 1)) (AND (GEQ s3 1) (GEQ s25 1)) (AND (GEQ s3 1) (GEQ s90 1)) (AND (GEQ s3 1) (GEQ s86 1)) (AND (GEQ s3 1) (GEQ s21 1)) (AND (GEQ s3 1) (GEQ s15 1)) (AND (GEQ s3 1) (GEQ s80 1)) (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s3 1) (GEQ s76 1)) (AND (GEQ s3 1) (GEQ s72 1)) (AND (GEQ s3 1) (GEQ s68 1)) (AND (GEQ s3 1) (GEQ s64 1)) (AND (GEQ s3 1) (GEQ s60 1)) (AND (GEQ s3 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s52 1)) (AND (GEQ s3 1) (GEQ s48 1)) (AND (GEQ s3 1) (GEQ s44 1)) (AND (GEQ s3 1) (GEQ s105 1)) (AND (GEQ s3 1) (GEQ s40 1)) (AND (GEQ s3 1) (GEQ s101 1)) (AND (GEQ s3 1) (GEQ s36 1)) (AND (GEQ s3 1) (GEQ s97 1)) (AND (GEQ s3 1) (GEQ s32 1)) (AND (GEQ s3 1) (GEQ s93 1)) (AND (GEQ s3 1) (GEQ s28 1)) (AND (GEQ s3 1) (GEQ s89 1)) (AND (GEQ s3 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s20 1)) (AND (GEQ s3 1) (GEQ s85 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 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-03 finished in 576 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(!p0)))))], 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 5 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 05:17:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:30] [INFO ] Implicit Places using invariants in 18 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2021-05-08 05:17:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:30] [INFO ] Dead Transitions using invariants and state equation in 35 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 05:17:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/268 places, 18/516 transitions.
Stuttering acceptance computed with spot in 79 ms :[false, p0, p0, true]
Running random walk in product with property : AirplaneLD-COL-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=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s2 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 8 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-COL-0100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-04 finished in 168 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 05:17:31] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:31] [INFO ] Implicit Places using invariants in 26 ms returned [9]
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 05:17:31] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-08 05:17:31] [INFO ] Dead Transitions using invariants and state equation in 51 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 05:17:31] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 05:17:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-COL-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) 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 p2 p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), 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 p2), acceptance={1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), 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 p1), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s3 1), p2:(GEQ s4 1), p1:(OR (AND (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s6 1) (GEQ s54 1)) (AND (GEQ s6 1) (GEQ s60 1)) (AND (GEQ s6 1) (GEQ s58 1)) (AND (GEQ s6 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s62 1)) (AND (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s38 1)) (AND (GEQ s6 1) (GEQ s44 1)) (AND (GEQ s6 1) (GEQ s42 1)) (AND (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s6 1) (GEQ s46 1)) (AND (GEQ s6 1) (GEQ s52 1)) (AND (GEQ s6 1) (GEQ s50 1)) (AND (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s6 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1)) (AND (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s6 1) (GEQ s30 1)) (AND (GEQ s6 1) (GEQ s36 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s18 1)) (AND (GEQ s6 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s55 1)) (AND (GEQ s6 1) (GEQ s53 1)) (AND (GEQ s6 1) (GEQ s59 1)) (AND (GEQ s6 1) (GEQ s57 1)) (AND (GEQ s6 1) (GEQ s63 1)) (AND (GEQ s6 1) (GEQ s61 1)) (AND (GEQ s6 1) (GEQ s39 1)) (AND (GEQ s6 1) (GEQ s37 1)) (AND (GEQ s6 1) (GEQ s43 1)) (AND (GEQ s6 1) (GEQ s41 1)) (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s6 1) (GEQ s45 1)) (AND (GEQ s6 1) (GEQ s51 1)) (AND (GEQ s6 1) (GEQ s49 1)) (AND (GEQ s6 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s27 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s29 1)) (AND (GEQ s6 1) (GEQ s35 1)) (AND (GEQ s6 1) (GEQ s33 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s19 1)))], 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 12701 reset in 444 ms.
Product exploration explored 100000 steps with 12684 reset in 215 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 (NOT p1))), p0, p2, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA AirplaneLD-COL-0100-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-COL-0100-05 finished in 1088 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 05:17:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 17 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 114 rows 66 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 66/268 places, 114/516 transitions.
Applied a total of 0 rules in 6 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 05:17:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/268 places, 114/516 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-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) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s56 1)) (AND (GEQ s6 1) (GEQ s54 1)) (AND (GEQ s6 1) (GEQ s60 1)) (AND (GEQ s6 1) (GEQ s58 1)) (AND (GEQ s6 1) (GEQ s64 1)) (AND (GEQ s6 1) (GEQ s62 1)) (AND (GEQ s6 1) (GEQ s40 1)) (AND (GEQ s6 1) (GEQ s38 1)) (AND (GEQ s6 1) (GEQ s44 1)) (AND (GEQ s6 1) (GEQ s42 1)) (AND (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s6 1) (GEQ s46 1)) (AND (GEQ s6 1) (GEQ s52 1)) (AND (GEQ s6 1) (GEQ s50 1)) (AND (GEQ s6 1) (GEQ s22 1)) (AND (GEQ s6 1) (GEQ s24 1)) (AND (GEQ s6 1) (GEQ s28 1)) (AND (GEQ s6 1) (GEQ s26 1)) (AND (GEQ s6 1) (GEQ s32 1)) (AND (GEQ s6 1) (GEQ s30 1)) (AND (GEQ s6 1) (GEQ s36 1)) (AND (GEQ s6 1) (GEQ s34 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s18 1)) (AND (GEQ s6 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s55 1)) (AND (GEQ s6 1) (GEQ s53 1)) (AND (GEQ s6 1) (GEQ s59 1)) (AND (GEQ s6 1) (GEQ s57 1)) (AND (GEQ s6 1) (GEQ s63 1)) (AND (GEQ s6 1) (GEQ s61 1)) (AND (GEQ s6 1) (GEQ s39 1)) (AND (GEQ s6 1) (GEQ s37 1)) (AND (GEQ s6 1) (GEQ s43 1)) (AND (GEQ s6 1) (GEQ s41 1)) (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s6 1) (GEQ s45 1)) (AND (GEQ s6 1) (GEQ s51 1)) (AND (GEQ s6 1) (GEQ s49 1)) (AND (GEQ s6 1) (GEQ s23 1)) (AND (GEQ s6 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s27 1)) (AND (GEQ s6 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s31 1)) (AND (GEQ s6 1) (GEQ s29 1)) (AND (GEQ s6 1) (GEQ s35 1)) (AND (GEQ s6 1) (GEQ s33 1)) (AND (GEQ s6 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s19 1))), p1:(LT s2 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 589 steps with 73 reset in 13 ms.
FORMULA AirplaneLD-COL-0100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-07 finished in 239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 747 place count 19 transition count 17
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 749 place count 18 transition count 17
Applied a total of 749 rules in 9 ms. Remains 18 /268 variables (removed 250) and now considering 17/516 (removed 499) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 49 ms to find 1 implicit places.
[2021-05-08 05:17:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 17/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 17 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 16 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 15 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 15 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 15 transition count 14
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 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 14 transition count 13
Applied a total of 7 rules in 4 ms. Remains 14 /17 variables (removed 3) and now considering 13/17 (removed 4) transitions.
// Phase 1: matrix 13 rows 14 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 13 rows 14 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 14 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 27 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 13/268 places, 13/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 13 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 11 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 11 transition count 11
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 11 transition count 10
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 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 10 transition count 9
Applied a total of 7 rules in 15 ms. Remains 10 /13 variables (removed 3) and now considering 9/13 (removed 4) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 14 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 9/268 places, 9/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 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 7 transition count 7
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 7
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 7 transition count 6
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 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 6 transition count 5
Applied a total of 7 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 12 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 5/268 places, 5/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 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 0 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 4/268 places, 4/516 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : AirplaneLD-COL-0100-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(GEQ 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, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-09 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 747 place count 19 transition count 17
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 749 place count 18 transition count 17
Applied a total of 749 rules in 8 ms. Remains 18 /268 variables (removed 250) and now considering 17/516 (removed 499) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 05:17:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 18 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
[2021-05-08 05:17:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 17/268 places, 17/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 17 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 15
Applied a total of 4 rules in 2 ms. Remains 15 /17 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 14/268 places, 15/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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 13
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 12 transition count 12
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 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 11
Applied a total of 7 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 12 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 21 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 10/268 places, 11/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 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 8 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 8 transition count 9
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 8 transition count 8
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 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 7 transition count 7
Applied a total of 7 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 10 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 6/268 places, 7/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 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 4 transition count 5
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 5
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 4 transition count 4
Applied a total of 5 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:32] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 4/268 places, 4/516 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : AirplaneLD-COL-0100-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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][true]]
Product exploration explored 100000 steps with 37509 reset in 89 ms.
Product exploration explored 100000 steps with 37501 reset in 101 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA AirplaneLD-COL-0100-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-COL-0100-10 finished in 396 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0||X(F((p0&&F(p1))))) U !p1)))], workingDir=/home/mcc/execution]
Support contains 3 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 3 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 05:17:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:33] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/268 places, 18/516 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, (OR (NOT p1) (NOT p0)), p1, (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s13 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-11 finished in 156 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 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 747 place count 19 transition count 17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 749 place count 18 transition count 17
Applied a total of 749 rules in 8 ms. Remains 18 /268 variables (removed 250) and now considering 17/516 (removed 499) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 12 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-08 05:17:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 17/268 places, 17/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 17 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 15
Applied a total of 4 rules in 1 ms. Remains 15 /17 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 13 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 14/268 places, 15/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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 13
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 12 transition count 12
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 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 11
Applied a total of 7 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 11 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 19 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 10/268 places, 11/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 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 8 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 8 transition count 9
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 8 transition count 8
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 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 7 transition count 7
Applied a total of 7 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 10 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 6/268 places, 7/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 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 4 transition count 5
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 5
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 4 transition count 4
Applied a total of 5 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 05:17:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 4/268 places, 4/516 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : AirplaneLD-COL-0100-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 28578 reset in 73 ms.
Product exploration explored 100000 steps with 28570 reset in 144 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA AirplaneLD-COL-0100-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-COL-0100-14 finished in 431 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G((X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 55 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 516/516 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 70 transition count 318
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 70 transition count 318
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 594 place count 70 transition count 120
Applied a total of 594 rules in 3 ms. Remains 70 /268 variables (removed 198) and now considering 120/516 (removed 396) transitions.
// Phase 1: matrix 120 rows 70 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 120 rows 70 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-08 05:17:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 70 cols
[2021-05-08 05:17:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 05:17:33] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/268 places, 120/516 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0100-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s13 1)), p2:(GEQ s1 1), p0:(OR (AND (GEQ s5 1) (GEQ s59 1)) (AND (GEQ s5 1) (GEQ s61 1)) (AND (GEQ s5 1) (GEQ s55 1)) (AND (GEQ s5 1) (GEQ s57 1)) (AND (GEQ s5 1) (GEQ s67 1)) (AND (GEQ s5 1) (GEQ s63 1)) (AND (GEQ s5 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s18 1)) (AND (GEQ s5 1) (GEQ s20 1)) (AND (GEQ s5 1) (GEQ s27 1)) (AND (GEQ s5 1) (GEQ s29 1)) (AND (GEQ s5 1) (GEQ s23 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s5 1) (GEQ s35 1)) (AND (GEQ s5 1) (GEQ s37 1)) (AND (GEQ s5 1) (GEQ s31 1)) (AND (GEQ s5 1) (GEQ s33 1)) (AND (GEQ s5 1) (GEQ s43 1)) (AND (GEQ s5 1) (GEQ s45 1)) (AND (GEQ s5 1) (GEQ s39 1)) (AND (GEQ s5 1) (GEQ s41 1)) (AND (GEQ s5 1) (GEQ s51 1)) (AND (GEQ s5 1) (GEQ s53 1)) (AND (GEQ s5 1) (GEQ s47 1)) (AND (GEQ s5 1) (GEQ s49 1)) (AND (GEQ s5 1) (GEQ s58 1)) (AND (GEQ s5 1) (GEQ s60 1)) (AND (GEQ s5 1) (GEQ s54 1)) (AND (GEQ s5 1) (GEQ s56 1)) (AND (GEQ s5 1) (GEQ s66 1)) (AND (GEQ s5 1) (GEQ s62 1)) (AND (GEQ s5 1) (GEQ s64 1)) (AND (GEQ s5 1) (GEQ s19 1)) (AND (GEQ s5 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s28 1)) (AND (GEQ s5 1) (GEQ s22 1)) (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s34 1)) (AND (GEQ s5 1) (GEQ s36 1)) (AND (GEQ s5 1) (GEQ s30 1)) (AND (GEQ s5 1) (GEQ s32 1)) (AND (GEQ s5 1) (GEQ s42 1)) (AND (GEQ s5 1) (GEQ s44 1)) (AND (GEQ s5 1) (GEQ s38 1)) (AND (GEQ s5 1) (GEQ s40 1)) (AND (GEQ s5 1) (GEQ s50 1)) (AND (GEQ s5 1) (GEQ s69 1)) (AND (GEQ s5 1) (GEQ s52 1)) (AND (GEQ s5 1) (GEQ s46 1)) (AND (GEQ s5 1) (GEQ s48 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][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0100-15 finished in 200 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620451055013

--------------------
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-COL-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-COL-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-162037989700194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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