fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689300435
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AutoFlight-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.136 13107.00 28999.00 70.90 TFTTFFTTTFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300435.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 36K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652661164646

Running Version 202205111006
[2022-05-16 00:32:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-16 00:32:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:32:46] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-16 00:32:46] [INFO ] Transformed 132 places.
[2022-05-16 00:32:46] [INFO ] Transformed 130 transitions.
[2022-05-16 00:32:46] [INFO ] Found NUPN structural information;
[2022-05-16 00:32:46] [INFO ] Parsed PT model containing 132 places and 130 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2022-05-16 00:32:46] [INFO ] Computed 34 place invariants in 10 ms
[2022-05-16 00:32:46] [INFO ] Implicit Places using invariants in 223 ms returned [7, 14, 21, 28, 35, 44, 47, 50, 99, 105, 111, 117, 123, 131]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 265 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/132 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 102
Applied a total of 6 rules in 9 ms. Remains 115 /118 variables (removed 3) and now considering 102/105 (removed 3) transitions.
// Phase 1: matrix 102 rows 115 cols
[2022-05-16 00:32:46] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 00:32:46] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 102 rows 115 cols
[2022-05-16 00:32:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:32:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/132 places, 102/105 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/132 places, 102/105 transitions.
Support contains 24 out of 115 places after structural reductions.
[2022-05-16 00:32:46] [INFO ] Flatten gal took : 27 ms
[2022-05-16 00:32:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA AutoFlight-PT-05a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 00:32:46] [INFO ] Flatten gal took : 10 ms
[2022-05-16 00:32:46] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 22 out of 115 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 299 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 102 rows 115 cols
[2022-05-16 00:32:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:47] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 00:32:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-05-16 00:32:47] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-05a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 10 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 114 cols
[2022-05-16 00:32:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:47] [INFO ] Implicit Places using invariants in 45 ms returned [33, 36, 69, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 101/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 93 transition count 84
Applied a total of 34 rules in 31 ms. Remains 93 /110 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:47] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:47] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:47] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:32:47] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/115 places, 84/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/115 places, 84/102 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s75 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AutoFlight-PT-05a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-00 finished in 978 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 18 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 114 cols
[2022-05-16 00:32:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:48] [INFO ] Implicit Places using invariants in 78 ms returned [33, 36, 69, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 101/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 100 transition count 91
Applied a total of 20 rules in 24 ms. Remains 100 /110 variables (removed 10) and now considering 91/101 (removed 10) transitions.
// Phase 1: matrix 91 rows 100 cols
[2022-05-16 00:32:48] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:32:48] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 91 rows 100 cols
[2022-05-16 00:32:48] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/115 places, 91/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/115 places, 91/102 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s50 0) (EQ s50 1)) (OR (EQ s21 0) (EQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-04 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(X(X(p0)))&&G(G(p1))))))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 114 cols
[2022-05-16 00:32:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:48] [INFO ] Implicit Places using invariants in 118 ms returned [33, 36, 69, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 121 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 101/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 95
Applied a total of 12 rules in 10 ms. Remains 104 /110 variables (removed 6) and now considering 95/101 (removed 6) transitions.
// Phase 1: matrix 95 rows 104 cols
[2022-05-16 00:32:48] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:49] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 95 rows 104 cols
[2022-05-16 00:32:49] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:49] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/115 places, 95/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 104/115 places, 95/102 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 4}]], initial=2, aps=[p1:(NEQ s67 1), p0:(EQ s67 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-05 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||X(p1))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 114 cols
[2022-05-16 00:32:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:49] [INFO ] Implicit Places using invariants in 36 ms returned [33, 36, 69, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 101/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 93 transition count 84
Applied a total of 34 rules in 27 ms. Remains 93 /110 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:49] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:49] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:49] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:32:49] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/115 places, 84/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 93/115 places, 84/102 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s85 0) (EQ s3 1) (EQ s31 0) (EQ s28 1)), p0:(OR (EQ s28 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4092 reset in 188 ms.
Product exploration explored 100000 steps with 4176 reset in 159 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 57 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 93 /93 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:50] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:50] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:50] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 93 cols
[2022-05-16 00:32:50] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 00:32:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 84/84 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 137 steps, including 5 resets, run visited all 2 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4119 reset in 107 ms.
Product exploration explored 100000 steps with 4064 reset in 106 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 84/84 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 93 transition count 84
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 93 transition count 84
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 84
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 43 place count 77 transition count 68
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 59 place count 77 transition count 68
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 77 transition count 68
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 73 transition count 64
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 73 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 79 rules in 24 ms. Remains 73 /93 variables (removed 20) and now considering 64/84 (removed 20) transitions.
[2022-05-16 00:32:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 73 cols
[2022-05-16 00:32:51] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:51] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/93 places, 64/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/93 places, 64/84 transitions.
Product exploration explored 100000 steps with 6119 reset in 240 ms.
Product exploration explored 100000 steps with 6121 reset in 250 ms.
Built C files in :
/tmp/ltsmin13330976737479441986
[2022-05-16 00:32:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13330976737479441986
Running compilation step : cd /tmp/ltsmin13330976737479441986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin13330976737479441986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13330976737479441986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1142881879943700730.hoa' '--buchi-type=spotba'
LTSmin run took 614 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLCardinality-10 finished in 3971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(X(X(p1)))&&p0))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 5 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 114 cols
[2022-05-16 00:32:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants in 40 ms returned [33, 36, 69, 112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 101/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 99
Applied a total of 4 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 99/101 (removed 2) transitions.
// Phase 1: matrix 99 rows 108 cols
[2022-05-16 00:32:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 99 rows 108 cols
[2022-05-16 00:32:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/115 places, 99/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 108/115 places, 99/102 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND 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}]], initial=0, aps=[p0:(AND (EQ s67 0) (EQ s94 1)), p1:(AND (EQ s67 0) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-11 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 115 cols
[2022-05-16 00:32:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants in 38 ms returned [36, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 101
Applied a total of 2 rules in 3 ms. Remains 112 /113 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 112 cols
[2022-05-16 00:32:53] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 101 rows 112 cols
[2022-05-16 00:32:53] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-16 00:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 00:32:53] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 112/115 places, 101/102 transitions.
Finished structural reductions, in 2 iterations. Remains : 112/115 places, 101/102 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s29 1)), p1:(AND (NEQ s68 0) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3426 reset in 98 ms.
Product exploration explored 100000 steps with 3402 reset in 109 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[false, false, (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[false, false, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[false, false, (NOT p1), (NOT p1)]
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 101/101 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 112 transition count 65
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 76 transition count 65
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 72 place count 76 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 69 transition count 58
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 106 place count 59 transition count 48
Applied a total of 106 rules in 16 ms. Remains 59 /112 variables (removed 53) and now considering 48/101 (removed 53) transitions.
// Phase 1: matrix 48 rows 59 cols
[2022-05-16 00:32:54] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-16 00:32:54] [INFO ] Implicit Places using invariants in 40 ms returned [22, 24, 25, 26, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 42 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/112 places, 48/101 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 50 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 49 transition count 43
Applied a total of 10 rules in 8 ms. Remains 49 /54 variables (removed 5) and now considering 43/48 (removed 5) transitions.
// Phase 1: matrix 43 rows 49 cols
[2022-05-16 00:32:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:32:55] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 43 rows 49 cols
[2022-05-16 00:32:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:32:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:32:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/112 places, 43/101 transitions.
Finished structural reductions, in 2 iterations. Remains : 49/112 places, 43/101 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 43 rows 49 cols
[2022-05-16 00:32:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:32:55] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 00:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:32:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 00:32:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:32:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 00:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:32:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 00:32:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 00:32:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2022-05-16 00:32:55] [INFO ] Computed and/alt/rep : 41/126/41 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 00:32:56] [INFO ] Added : 40 causal constraints over 8 iterations in 66 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10365 reset in 137 ms.
Product exploration explored 100000 steps with 10504 reset in 149 ms.
Built C files in :
/tmp/ltsmin855291873186960129
[2022-05-16 00:32:56] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2022-05-16 00:32:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:32:56] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2022-05-16 00:32:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:32:56] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2022-05-16 00:32:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:32:56] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin855291873186960129
Running compilation step : cd /tmp/ltsmin855291873186960129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin855291873186960129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin855291873186960129;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13379975221805902063.hoa' '--buchi-type=spotba'
LTSmin run took 1002 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLCardinality-13 finished in 4043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(G(X((G(p0)||p0))))))))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 112 transition count 61
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 72 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 82 place count 72 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 97 place count 62 transition count 56
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 62 transition count 51
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 107 place count 57 transition count 51
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 56 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 56 transition count 50
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 135 place count 43 transition count 37
Applied a total of 135 rules in 7 ms. Remains 43 /115 variables (removed 72) and now considering 37/102 (removed 65) transitions.
// Phase 1: matrix 37 rows 43 cols
[2022-05-16 00:32:57] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:32:57] [INFO ] Implicit Places using invariants in 41 ms returned [25, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/115 places, 37/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 41/115 places, 37/102 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-15 finished in 80 ms.
All properties solved by simple procedures.
Total runtime 11840 ms.

BK_STOP 1652661177753

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689300435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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