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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
631.611 26668.00 42622.00 215.30 FFTTTFFFFFFTTFFF 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-162037990000450.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620470333096

Running Version 0
[2021-05-08 10:38:54] [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 10:38:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:38:54] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-08 10:38:54] [INFO ] Transformed 157 places.
[2021-05-08 10:38:54] [INFO ] Transformed 155 transitions.
[2021-05-08 10:38:54] [INFO ] Found NUPN structural information;
[2021-05-08 10:38:54] [INFO ] Parsed PT model containing 157 places and 155 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:38:54] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA AutoFlight-PT-06a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 16 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2021-05-08 10:38:54] [INFO ] Computed 40 place invariants in 15 ms
[2021-05-08 10:38:55] [INFO ] Implicit Places using invariants in 216 ms returned [7, 21, 28, 35, 45, 48, 51, 54, 57, 92, 118, 124, 136, 148, 154]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 245 ms to find 15 implicit places.
// Phase 1: matrix 125 rows 142 cols
[2021-05-08 10:38:55] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-08 10:38:55] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 142/157 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 121
Applied a total of 8 rules in 17 ms. Remains 138 /142 variables (removed 4) and now considering 121/125 (removed 4) transitions.
// Phase 1: matrix 121 rows 138 cols
[2021-05-08 10:38:55] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-08 10:38:55] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 121 rows 138 cols
[2021-05-08 10:38:55] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:38:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-08 10:38:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 138/157 places, 121/125 transitions.
[2021-05-08 10:38:55] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-08 10:38:55] [INFO ] Flatten gal took : 35 ms
FORMULA AutoFlight-PT-06a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:38:55] [INFO ] Flatten gal took : 13 ms
[2021-05-08 10:38:55] [INFO ] Input system was already deterministic with 121 transitions.
Finished random walk after 19771 steps, including 533 resets, run visited all 24 properties in 94 ms. (steps per millisecond=210 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0 U (p1||G(p0)))) U (!p0||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 138 transition count 98
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 115 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 114 transition count 97
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 48 place count 114 transition count 80
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 82 place count 97 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 96 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 96 transition count 79
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 108 place count 84 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 83 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 83 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 82 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 82 transition count 65
Applied a total of 112 rules in 36 ms. Remains 82 /138 variables (removed 56) and now considering 65/121 (removed 56) transitions.
// Phase 1: matrix 65 rows 82 cols
[2021-05-08 10:38:55] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-08 10:38:55] [INFO ] Implicit Places using invariants in 54 ms returned [9, 27, 28, 29, 30, 31, 34, 35, 64, 72, 81]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 55 ms to find 11 implicit places.
[2021-05-08 10:38:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 71 cols
[2021-05-08 10:38:55] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 10:38:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 71/138 places, 65/121 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 71 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 62 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 62 transition count 55
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 20 place count 61 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 59 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 59 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 56 transition count 50
Applied a total of 30 rules in 13 ms. Remains 56 /71 variables (removed 15) and now considering 50/65 (removed 15) transitions.
// Phase 1: matrix 50 rows 56 cols
[2021-05-08 10:38:55] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-08 10:38:55] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 50 rows 56 cols
[2021-05-08 10:38:55] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 10:38:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-08 10:38:56] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 56/138 places, 50/121 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s21 1), p2:(EQ s28 1), p1:(AND (NEQ s27 1) (NEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-06a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-01 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U X((X(p2)||p1)))||F(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Applied a total of 4 rules in 8 ms. Remains 136 /138 variables (removed 2) and now considering 119/121 (removed 2) transitions.
// Phase 1: matrix 119 rows 136 cols
[2021-05-08 10:38:56] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:38:56] [INFO ] Implicit Places using invariants in 51 ms returned [38, 51, 115, 125, 135]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 52 ms to find 5 implicit places.
// Phase 1: matrix 119 rows 131 cols
[2021-05-08 10:38:56] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-08 10:38:56] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 131/138 places, 119/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 117
Applied a total of 4 rules in 5 ms. Remains 129 /131 variables (removed 2) and now considering 117/119 (removed 2) transitions.
// Phase 1: matrix 117 rows 129 cols
[2021-05-08 10:38:56] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:38:56] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 117 rows 129 cols
[2021-05-08 10:38:56] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:38:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 10:38:56] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 129/138 places, 117/121 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06a-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s89 1), p3:(AND (EQ s13 1) (EQ s52 1)), p1:(OR (EQ s10 0) (EQ s99 0)), p2:(AND (EQ s10 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 365 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Knowledge obtained : [(NOT p0), (NOT p3), p1, (NOT p2)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0))]
Support contains 5 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 117/117 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 129 transition count 117
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 35 place count 129 transition count 117
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 129 transition count 117
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 73 place count 101 transition count 89
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 101 place count 101 transition count 89
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 101 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 100 transition count 88
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 100 transition count 88
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 117 rules in 15 ms. Remains 100 /129 variables (removed 29) and now considering 88/117 (removed 29) transitions.
[2021-05-08 10:38:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 100 cols
[2021-05-08 10:38:58] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:38:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/129 places, 88/117 transitions.
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
[2021-05-08 10:38:59] [INFO ] Flatten gal took : 9 ms
[2021-05-08 10:38:59] [INFO ] Flatten gal took : 8 ms
[2021-05-08 10:38:59] [INFO ] Time to serialize gal into /tmp/LTL11616850653436930314.gal : 4 ms
[2021-05-08 10:38:59] [INFO ] Time to serialize properties into /tmp/LTL10594747307392522761.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11616850653436930314.gal, -t, CGAL, -LTL, /tmp/LTL10594747307392522761.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11616850653436930314.gal -t CGAL -LTL /tmp/LTL10594747307392522761.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("(p103==1)"))U(X(("((p11==0)||(p113==0))")||(X("((p11==1)&&(p113==1))")))))||(F("((p14==1)&&(p63==1))"))))
Formula 0 simplified : !((G"(p103==1)" U X("((p11==0)||(p113==0))" | X"((p11==1)&&(p113==1))")) | F"((p14==1)&&(p63==1))")
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t44, t62, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/102/15/117
Computing Next relation with stutter on 12 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
61 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.631992,36992,1,0,210,100370,266,115,3614,74148,249
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06a-02 finished in 3610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 138 cols
[2021-05-08 10:38:59] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:38:59] [INFO ] Implicit Places using invariants in 46 ms returned [13, 38, 51, 117, 127]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 46 ms to find 5 implicit places.
// Phase 1: matrix 121 rows 133 cols
[2021-05-08 10:38:59] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:38:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 133/138 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 119
Applied a total of 4 rules in 15 ms. Remains 131 /133 variables (removed 2) and now considering 119/121 (removed 2) transitions.
// Phase 1: matrix 119 rows 131 cols
[2021-05-08 10:38:59] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:00] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 119 rows 131 cols
[2021-05-08 10:39:00] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-08 10:39:00] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 131/138 places, 119/121 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06a-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (NEQ s80 1) (NEQ s130 1)) (OR (NEQ s30 1) (NEQ s122 1))), p0:(NEQ s12 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]]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 131/131 places, 119/119 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 131 transition count 119
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 39 place count 131 transition count 125
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 52 place count 131 transition count 125
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 90 place count 93 transition count 87
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 128 place count 93 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 139 place count 93 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 92 transition count 86
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 92 transition count 86
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 141 rules in 11 ms. Remains 92 /131 variables (removed 39) and now considering 86/119 (removed 33) transitions.
[2021-05-08 10:39:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 86 rows 92 cols
[2021-05-08 10:39:01] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-08 10:39:01] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 92/131 places, 86/119 transitions.
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Product exploration explored 100000 steps with 50000 reset in 551 ms.
[2021-05-08 10:39:02] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:39:02] [INFO ] Flatten gal took : 7 ms
[2021-05-08 10:39:02] [INFO ] Time to serialize gal into /tmp/LTL6369967452627919137.gal : 3 ms
[2021-05-08 10:39:02] [INFO ] Time to serialize properties into /tmp/LTL9182645308450871450.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6369967452627919137.gal, -t, CGAL, -LTL, /tmp/LTL9182645308450871450.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6369967452627919137.gal -t CGAL -LTL /tmp/LTL9182645308450871450.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p13!=1)"))||(X(F("(((p93!=1)||(p156!=1))&&((p34!=1)||(p145!=1)))")))))
Formula 0 simplified : !(G"(p13!=1)" | XF"(((p93!=1)||(p156!=1))&&((p34!=1)||(p145!=1)))")
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t111, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/14/119
Computing Next relation with stutter on 12 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
99 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.999225,38848,1,0,210,117640,269,117,3697,131938,256
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-06a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-06a-04 finished in 3726 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0&&(p1 U (p2||G(p1))))||F(((p3&&X(p4))||G(p4))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 133 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 133 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 132 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 132 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 131 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 131 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 129 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 129 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 128 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 128 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Applied a total of 28 rules in 22 ms. Remains 124 /138 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 124 cols
[2021-05-08 10:39:03] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:39:03] [INFO ] Implicit Places using invariants in 41 ms returned [13, 51, 103, 113, 123]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 42 ms to find 5 implicit places.
// Phase 1: matrix 107 rows 119 cols
[2021-05-08 10:39:03] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:03] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 119/138 places, 107/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 101
Applied a total of 12 rules in 6 ms. Remains 113 /119 variables (removed 6) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 113 cols
[2021-05-08 10:39:03] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:03] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 101 rows 113 cols
[2021-05-08 10:39:03] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 10:39:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 113/138 places, 101/121 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p4), (NOT p4)]
Running random walk in product with property : AutoFlight-PT-06a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p4), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p4), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(AND p3 (NOT p4)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (NEQ s37 1) (NEQ s81 1)), p0:(EQ s36 1), p2:(AND (NEQ s36 1) (OR (NEQ s18 1) (NEQ s97 1))), p1:(OR (NEQ s18 1) (NEQ s97 1)), p4:(AND (NEQ s18 0) (NEQ s97 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-05 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 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 43 rules applied. Total rules applied 43 place count 134 transition count 80
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 83 place count 94 transition count 80
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 83 place count 94 transition count 67
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 115 place count 75 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 115 place count 75 transition count 61
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 69 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 68 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 68 transition count 60
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 2 with 26 rules applied. Total rules applied 155 place count 55 transition count 47
Applied a total of 155 rules in 9 ms. Remains 55 /138 variables (removed 83) and now considering 47/121 (removed 74) transitions.
// Phase 1: matrix 47 rows 55 cols
[2021-05-08 10:39:03] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 10:39:03] [INFO ] Implicit Places using invariants in 25 ms returned [42, 48, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
[2021-05-08 10:39:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 47 rows 52 cols
[2021-05-08 10:39:04] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-08 10:39:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 52/138 places, 47/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 49 transition count 44
Applied a total of 6 rules in 9 ms. Remains 49 /52 variables (removed 3) and now considering 44/47 (removed 3) transitions.
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 10:39:04] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 44 rows 49 cols
[2021-05-08 10:39:04] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 49/138 places, 44/121 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s27 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 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-07 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 133 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 133 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 132 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 132 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 131 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 131 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 129 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 129 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 128 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 128 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Applied a total of 28 rules in 29 ms. Remains 124 /138 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 124 cols
[2021-05-08 10:39:04] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 42 ms returned [13, 38, 51, 103, 113, 123]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 43 ms to find 6 implicit places.
// Phase 1: matrix 107 rows 118 cols
[2021-05-08 10:39:04] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 118/138 places, 107/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 5 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:39:04] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:39:04] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 111/138 places, 100/121 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(NEQ s18 1), p1:(OR (NEQ s25 1) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-08 finished in 365 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 133 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 133 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 132 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 132 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 131 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 131 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 129 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 129 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 128 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 128 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Applied a total of 28 rules in 15 ms. Remains 124 /138 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 124 cols
[2021-05-08 10:39:04] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 62 ms returned [38, 51, 103, 113, 123]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
// Phase 1: matrix 107 rows 119 cols
[2021-05-08 10:39:04] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-08 10:39:04] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 119/138 places, 107/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 105
Applied a total of 4 rules in 3 ms. Remains 117 /119 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 117 cols
[2021-05-08 10:39:04] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 105 rows 117 cols
[2021-05-08 10:39:04] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 117/138 places, 105/121 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s70 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][false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-09 finished in 332 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||(F(p1)&&F(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 133 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 133 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 132 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 132 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 131 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 131 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 129 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 129 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 128 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 128 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Applied a total of 28 rules in 16 ms. Remains 124 /138 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 124 cols
[2021-05-08 10:39:04] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:39:04] [INFO ] Implicit Places using invariants in 47 ms returned [13, 38, 103, 113, 123]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 48 ms to find 5 implicit places.
// Phase 1: matrix 107 rows 119 cols
[2021-05-08 10:39:04] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-08 10:39:04] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 119/138 places, 107/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 100
Applied a total of 14 rules in 5 ms. Remains 112 /119 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 112 cols
[2021-05-08 10:39:04] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:05] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 100 rows 112 cols
[2021-05-08 10:39:05] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:39:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 112/138 places, 100/121 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 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 p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 1), p1:(OR (NEQ s49 1) (NEQ s110 1)), p2:(AND (NEQ s23 1) (OR (NEQ s49 1) (NEQ s110 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2740 reset in 184 ms.
Product exploration explored 100000 steps with 2799 reset in 213 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2885 reset in 165 ms.
Product exploration explored 100000 steps with 2787 reset in 299 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Support contains 4 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 112/112 places, 100/100 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 112 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 27 place count 112 transition count 100
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 112 transition count 100
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 53 place count 92 transition count 80
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 73 place count 92 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 92 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 88 transition count 76
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 88 transition count 76
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 94 rules in 8 ms. Remains 88 /112 variables (removed 24) and now considering 76/100 (removed 24) transitions.
[2021-05-08 10:39:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 76 rows 88 cols
[2021-05-08 10:39:06] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 10:39:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/112 places, 76/100 transitions.
Product exploration explored 100000 steps with 4787 reset in 454 ms.
Product exploration explored 100000 steps with 4794 reset in 205 ms.
[2021-05-08 10:39:07] [INFO ] Flatten gal took : 6 ms
[2021-05-08 10:39:07] [INFO ] Flatten gal took : 6 ms
[2021-05-08 10:39:07] [INFO ] Time to serialize gal into /tmp/LTL7304523526913296763.gal : 1 ms
[2021-05-08 10:39:07] [INFO ] Time to serialize properties into /tmp/LTL9014021926811711465.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7304523526913296763.gal, -t, CGAL, -LTL, /tmp/LTL9014021926811711465.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7304523526913296763.gal -t CGAL -LTL /tmp/LTL9014021926811711465.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p2==1)")||((F("((p60!=1)||(p153!=1))"))&&(F(G("((p26!=1)&&((p60!=1)||(p153!=1)))"))))))))
Formula 0 simplified : !XG("(p2==1)" | (F"((p60!=1)||(p153!=1))" & FG"((p26!=1)&&((p60!=1)||(p153!=1)))"))
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/15/100
Computing Next relation with stutter on 12 deadlock states
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
552 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.53594,180428,1,0,480,670942,249,381,3315,1.19969e+06,836
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-06a-10 finished in 8887 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 138 transition count 96
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 113 transition count 96
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 50 place count 113 transition count 78
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 86 place count 95 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 94 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 94 transition count 77
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 2 with 26 rules applied. Total rules applied 114 place count 81 transition count 64
Applied a total of 114 rules in 8 ms. Remains 81 /138 variables (removed 57) and now considering 64/121 (removed 57) transitions.
// Phase 1: matrix 64 rows 81 cols
[2021-05-08 10:39:13] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:39:13] [INFO ] Implicit Places using invariants in 41 ms returned [26, 27, 28, 29, 30, 31, 32, 33, 63, 71, 80]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 42 ms to find 11 implicit places.
[2021-05-08 10:39:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 70 cols
[2021-05-08 10:39:13] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-08 10:39:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 70/138 places, 64/121 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 70 transition count 57
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 63 transition count 57
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 63 transition count 53
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 59 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 57 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 57 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 56 transition count 50
Applied a total of 28 rules in 4 ms. Remains 56 /70 variables (removed 14) and now considering 50/64 (removed 14) transitions.
// Phase 1: matrix 50 rows 56 cols
[2021-05-08 10:39:13] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 10:39:13] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 50 rows 56 cols
[2021-05-08 10:39:13] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 10:39:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-08 10:39:13] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 56/138 places, 50/121 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s26 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 15 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-14 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G((G(p1)||p0))||X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 135 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 135 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 134 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 134 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 133 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 133 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 132 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 132 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 131 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 131 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 129 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 129 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 128 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 128 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 107
Applied a total of 28 rules in 12 ms. Remains 124 /138 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 124 cols
[2021-05-08 10:39:13] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-08 10:39:13] [INFO ] Implicit Places using invariants in 51 ms returned [13, 38, 51, 103, 113, 123]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
// Phase 1: matrix 107 rows 118 cols
[2021-05-08 10:39:13] [INFO ] Computed 19 place invariants in 0 ms
[2021-05-08 10:39:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 118/138 places, 107/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 111 transition count 100
Applied a total of 14 rules in 4 ms. Remains 111 /118 variables (removed 7) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:39:14] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:14] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:39:14] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:14] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 111/138 places, 100/121 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s20 1) (NEQ s27 1)), p1:(NEQ s27 1), p2:(NEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2807 reset in 249 ms.
Product exploration explored 100000 steps with 2750 reset in 280 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 2776 reset in 141 ms.
Product exploration explored 100000 steps with 2746 reset in 159 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 2 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 111/111 places, 100/100 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 28 place count 111 transition count 100
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 111 transition count 100
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 54 place count 91 transition count 80
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 74 place count 91 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 87 place count 91 transition count 80
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 87 transition count 76
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 87 transition count 76
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 95 rules in 7 ms. Remains 87 /111 variables (removed 24) and now considering 76/100 (removed 24) transitions.
[2021-05-08 10:39:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 87 cols
[2021-05-08 10:39:15] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-08 10:39:15] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/111 places, 76/100 transitions.
Product exploration explored 100000 steps with 4815 reset in 245 ms.
Product exploration explored 100000 steps with 4856 reset in 291 ms.
[2021-05-08 10:39:15] [INFO ] Flatten gal took : 5 ms
[2021-05-08 10:39:15] [INFO ] Flatten gal took : 6 ms
[2021-05-08 10:39:15] [INFO ] Time to serialize gal into /tmp/LTL13634047903126039045.gal : 1 ms
[2021-05-08 10:39:15] [INFO ] Time to serialize properties into /tmp/LTL9011495317994229423.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13634047903126039045.gal, -t, CGAL, -LTL, /tmp/LTL9011495317994229423.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13634047903126039045.gal -t CGAL -LTL /tmp/LTL9011495317994229423.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G(("((p23!=1)||(p31!=1))")||(G("(p31!=1)"))))||(X(F("(p23!=1)"))))))
Formula 0 simplified : !G(G("((p23!=1)||(p31!=1))" | G"(p31!=1)") | XF"(p23!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/15/100
Computing Next relation with stutter on 12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
249 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.50061,87800,1,0,260,288733,240,166,3294,512635,396
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-06a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-06a-15 finished in 4917 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620470359764

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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