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-162037989900370.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-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989900370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 8.7K 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-01a-00
FORMULA_NAME AutoFlight-PT-01a-01
FORMULA_NAME AutoFlight-PT-01a-02
FORMULA_NAME AutoFlight-PT-01a-03
FORMULA_NAME AutoFlight-PT-01a-04
FORMULA_NAME AutoFlight-PT-01a-05
FORMULA_NAME AutoFlight-PT-01a-06
FORMULA_NAME AutoFlight-PT-01a-07
FORMULA_NAME AutoFlight-PT-01a-08
FORMULA_NAME AutoFlight-PT-01a-09
FORMULA_NAME AutoFlight-PT-01a-10
FORMULA_NAME AutoFlight-PT-01a-11
FORMULA_NAME AutoFlight-PT-01a-12
FORMULA_NAME AutoFlight-PT-01a-13
FORMULA_NAME AutoFlight-PT-01a-14
FORMULA_NAME AutoFlight-PT-01a-15

=== Now, execution of the tool begins

BK_START 1620465258090

Running Version 0
[2021-05-08 09:14:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 09:14:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:14:19] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-08 09:14:19] [INFO ] Transformed 32 places.
[2021-05-08 09:14:19] [INFO ] Transformed 30 transitions.
[2021-05-08 09:14:19] [INFO ] Found NUPN structural information;
[2021-05-08 09:14:19] [INFO ] Parsed PT model containing 32 places and 30 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 09:14:19] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Support contains 24 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 32 /32 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 32 cols
[2021-05-08 09:14:19] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-08 09:14:19] [INFO ] Implicit Places using invariants in 85 ms returned [17, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
// Phase 1: matrix 25 rows 30 cols
[2021-05-08 09:14:19] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-08 09:14:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 25/25 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 30 cols
[2021-05-08 09:14:19] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-08 09:14:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 25/25 transitions.
[2021-05-08 09:14:20] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 09:14:20] [INFO ] Flatten gal took : 20 ms
FORMULA AutoFlight-PT-01a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:14:20] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:14:20] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 100000 steps, including 4189 resets, run finished after 313 ms. (steps per millisecond=319 ) properties (out of 21) seen :18
Running SMT prover for 3 properties.
// Phase 1: matrix 25 rows 30 cols
[2021-05-08 09:14:20] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-08 09:14:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-08 09:14:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2021-05-08 09:14:20] [INFO ] Initial state test concluded for 1 properties.
FORMULA AutoFlight-PT-01a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((p1||X((p2 U X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:14:20] [INFO ] Implicit Places using invariants in 22 ms returned [7, 10, 22, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 26 ms to find 4 implicit places.
// Phase 1: matrix 24 rows 25 cols
[2021-05-08 09:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 25/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 21 transition count 20
Applied a total of 8 rules in 4 ms. Remains 21 /25 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 20/25 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01a-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (EQ s2 1) (AND (EQ s4 1) (EQ s15 1))), p1:(AND (NEQ s4 0) (NEQ s15 0)), p2:(EQ s2 1), p3:(EQ s6 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, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-01a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-00 finished in 558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants in 21 ms returned [10, 22, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:14:21] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 09:14:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 26/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 23
Applied a total of 2 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 23/24 (removed 1) transitions.
// Phase 1: matrix 23 rows 25 cols
[2021-05-08 09:14:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 23 rows 25 cols
[2021-05-08 09:14:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants and state equation in 37 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 : 25/30 places, 23/25 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-01a-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s12 1), p1:(AND (EQ s7 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 ms.
FORMULA AutoFlight-PT-01a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-02 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F((X(p1)||p0))) U ((X(F((X(p1)||p2)))&&(X(p4)||p3))||G(F(p5)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants in 39 ms returned [7, 10, 22, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 39 ms to find 4 implicit places.
// Phase 1: matrix 24 rows 25 cols
[2021-05-08 09:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 25/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 21 transition count 20
Applied a total of 8 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 20/25 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (AND (NOT p3) (NOT p4) (NOT p5)) (AND (NOT p1) (NOT p2) (NOT p5))), (AND (NOT p2) (NOT p5) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5)) (AND (NOT p1) (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p3) (NOT p4) (NOT p5))), (AND (NOT p5) (NOT p2) (NOT p1)), (AND (NOT p5) (NOT p4) (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p4) (NOT p5)) (AND (NOT p3) (NOT p4) (NOT p5))), (AND (NOT p2) (NOT p1) (NOT p5)), (AND (NOT p5) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p5)), (AND (NOT p5) (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01a-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p5)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p5) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(NOT p4), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p5) (NOT p4)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p5) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p5) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p5) (NOT p0) (NOT p4)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p5) (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p5) (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p5) (NOT p4)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p5) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p5) (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p5) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p5) (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p3:(OR (NEQ s6 1) (NEQ s17 1)), p5:(OR (NEQ s8 1) (NEQ s6 1) (NEQ s17 1)), p2:(OR (NEQ s6 1) (NEQ s17 1)), p4:(OR (NEQ s6 1) (NEQ s17 1)), p0:(OR (NEQ s6 1) (NEQ s17 1)), p1:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Knowledge obtained : [p3, p5, p2, p4, p0, p1]
Adopting property with smaller alphabet thanks to knowledge :p3
Stuttering acceptance computed with spot in 106 ms :[(AND p3 (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p5)), (AND (NOT p2) (NOT p5) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:22] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 20/20 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND p3 (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p5)), (AND (NOT p2) (NOT p5) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND p3 (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p5) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p5)), (AND (NOT p2) (NOT p5) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 20 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 20 transition count 19
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 19
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 16 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 18 rules in 9 ms. Remains 16 /21 variables (removed 5) and now considering 23/20 (removed -3) transitions.
[2021-05-08 09:14:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 16 cols
[2021-05-08 09:14:23] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 23/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
[2021-05-08 09:14:23] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:14:23] [INFO ] Flatten gal took : 2 ms
[2021-05-08 09:14:23] [INFO ] Time to serialize gal into /tmp/LTL8444114732565780181.gal : 0 ms
[2021-05-08 09:14:23] [INFO ] Time to serialize properties into /tmp/LTL17481923557371183403.ltl : 5 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/LTL8444114732565780181.gal, -t, CGAL, -LTL, /tmp/LTL17481923557371183403.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/LTL8444114732565780181.gal -t CGAL -LTL /tmp/LTL17481923557371183403.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F(("((p6!=1)||(p26!=1))")||(X("(p9!=1)")))))U((G(F("(((p9!=1)||(p6!=1))||(p26!=1))")))||((X(F(("((p6!=1)||(p26!=1))")||(X("(p9!=1)")))))&&(("((p6!=1)||(p26!=1))")||(X("((p6!=1)||(p26!=1))")))))))
Formula 0 simplified : !(XF("((p6!=1)||(p26!=1))" | X"(p9!=1)") U (GF"(((p9!=1)||(p6!=1))||(p26!=1))" | (XF("((p6!=1)||(p26!=1))" | X"(p9!=1)") & ("((p6!=1)||(p26!=1))" | X"((p6!=1)||(p26!=1))"))))
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/16/4/20
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.027991,17908,1,0,49,1647,66,23,599,1654,59
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-01a-04 finished in 2261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 22 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 22 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 17 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 17 transition count 14
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 23 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 15 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 15 transition count 13
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 27 place count 14 transition count 12
Applied a total of 27 rules in 5 ms. Remains 14 /30 variables (removed 16) and now considering 12/25 (removed 13) transitions.
// Phase 1: matrix 12 rows 14 cols
[2021-05-08 09:14:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Implicit Places using invariants in 19 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-08 09:14:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-08 09:14:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 12/30 places, 12/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 11
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
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 4 place count 10 transition count 10
Applied a total of 4 rules in 13 ms. Remains 10 /12 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-08 09:14:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-08 09:14:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/30 places, 10/25 transitions.
Stuttering acceptance computed with spot in 22 ms :[p0]
Running random walk in product with property : AutoFlight-PT-01a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9263 reset in 171 ms.
Stack based approach found an accepted trace after 968 steps with 101 reset with depth 4 and stack size 4 in 2 ms.
FORMULA AutoFlight-PT-01a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-07 finished in 292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:23] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:23] [INFO ] Implicit Places using invariants in 16 ms returned [7, 10, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:14:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 26/30 places, 24/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:14:24] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/30 places, 24/25 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s25 1)), p1:(AND (EQ s2 0) (OR (EQ s15 0) (EQ s25 0)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 3 reset in 0 ms.
FORMULA AutoFlight-PT-01a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-08 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:24] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants in 17 ms returned [7, 10, 22, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 24 rows 25 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 25/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 21 transition count 20
Applied a total of 8 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 20/25 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s3 1), p0:(AND (EQ s3 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-09 finished in 280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(p0)], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 23 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 23 transition count 16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 18 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 18 transition count 15
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 21 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 16 transition count 14
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 14 transition count 12
Applied a total of 27 rules in 5 ms. Remains 14 /30 variables (removed 16) and now considering 12/25 (removed 13) transitions.
// Phase 1: matrix 12 rows 14 cols
[2021-05-08 09:14:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
[2021-05-08 09:14:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 13/30 places, 12/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-08 09:14:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/30 places, 12/25 transitions.
[2021-05-08 09:14:24] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-01a-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-10 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&X((X(F(!p1))||(X(p2) U ((!p1&&X(p2))||X(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:24] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants in 18 ms returned [7, 10, 22, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 19 ms to find 4 implicit places.
// Phase 1: matrix 24 rows 25 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 25/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 24 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 23 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 22 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 21 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 21 transition count 20
Applied a total of 8 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-08 09:14:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/30 places, 20/25 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : AutoFlight-PT-01a-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s8 1), p1:(AND (EQ s3 1) (EQ s16 1)), p2:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40042 reset in 128 ms.
Product exploration explored 100000 steps with 40029 reset in 126 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 155 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Product exploration explored 100000 steps with 39991 reset in 90 ms.
Product exploration explored 100000 steps with 39969 reset in 88 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 143 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 20 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 20 transition count 19
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 19
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 16 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 16 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 18 rules in 5 ms. Remains 16 /21 variables (removed 5) and now considering 23/20 (removed -3) transitions.
[2021-05-08 09:14:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 16 cols
[2021-05-08 09:14:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:25] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 23/20 transitions.
Product exploration explored 100000 steps with 40075 reset in 237 ms.
Product exploration explored 100000 steps with 39977 reset in 165 ms.
[2021-05-08 09:14:26] [INFO ] Flatten gal took : 3 ms
[2021-05-08 09:14:26] [INFO ] Flatten gal took : 2 ms
[2021-05-08 09:14:26] [INFO ] Time to serialize gal into /tmp/LTL13887043620362603699.gal : 1 ms
[2021-05-08 09:14:26] [INFO ] Time to serialize properties into /tmp/LTL8194259637993801025.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/LTL13887043620362603699.gal, -t, CGAL, -LTL, /tmp/LTL8194259637993801025.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/LTL13887043620362603699.gal -t CGAL -LTL /tmp/LTL8194259637993801025.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p9==1)"))&&(X((X(F("((p3!=1)||(p25!=1))")))||((X("(p3!=1)"))U((("((p3!=1)||(p25!=1))")&&(X("(p3!=1)")))||(X(G("(p3!=1)")))))))))
Formula 0 simplified : !(F"(p9==1)" & X(XF"((p3!=1)||(p25!=1))" | (X"(p3!=1)" U (("((p3!=1)||(p25!=1))" & X"(p3!=1)") | XG"(p3!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/16/4/20
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 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.019879,17884,1,0,50,1688,74,24,595,1691,62
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-01a-11 finished in 1634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((X(F(!p0))&&G(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:26] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 23 ms returned [7, 22, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 26/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 24 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 24 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 23 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 23 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 22 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 22 transition count 20
Applied a total of 8 rules in 3 ms. Remains 22 /26 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/30 places, 20/25 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-01a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s2 1), p1:(OR (NEQ s9 1) (NEQ s20 1)), p0:(NEQ s3 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][false, 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-01a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-12 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 24 transition count 19
Applied a total of 12 rules in 4 ms. Remains 24 /30 variables (removed 6) and now considering 19/25 (removed 6) transitions.
// Phase 1: matrix 19 rows 24 cols
[2021-05-08 09:14:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 18 ms returned [6, 7, 17, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
[2021-05-08 09:14:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 20 cols
[2021-05-08 09:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/30 places, 19/25 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 17
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 17 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 17 transition count 16
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 8 place count 16 transition count 15
Applied a total of 8 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 15/19 (removed 4) transitions.
// Phase 1: matrix 15 rows 16 cols
[2021-05-08 09:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-08 09:14:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 09:14:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/30 places, 15/25 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-01a-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s1 0) (EQ s9 0)) (OR (EQ s5 0) (EQ s6 0) (EQ s0 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6103 reset in 87 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA AutoFlight-PT-01a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-13 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F((X(p2)&&p1))&&F(G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 29 cols
[2021-05-08 09:14:26] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 30 ms returned [10, 22, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
// Phase 1: matrix 24 rows 26 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 26/30 places, 24/25 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 24 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 24 transition count 22
Applied a total of 4 rules in 2 ms. Remains 24 /26 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 24 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 22 rows 24 cols
[2021-05-08 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/30 places, 22/25 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p3), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-01a-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s12 0), p1:(AND (EQ s7 1) (EQ s17 1)), p3:(NEQ s3 1), p2:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-01a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-14 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 25/25 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 29 transition count 21
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 8 place count 26 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 25 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 25 transition count 20
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 12 place count 24 transition count 19
Applied a total of 12 rules in 4 ms. Remains 24 /30 variables (removed 6) and now considering 19/25 (removed 6) transitions.
// Phase 1: matrix 19 rows 24 cols
[2021-05-08 09:14:26] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 19 ms returned [6, 7, 8, 17, 23]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 20 ms to find 5 implicit places.
[2021-05-08 09:14:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 19 rows 19 cols
[2021-05-08 09:14:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 19/30 places, 19/25 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 19 transition count 14
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 14 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 13 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 13 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 18 place count 10 transition count 16
Applied a total of 18 rules in 2 ms. Remains 10 /19 variables (removed 9) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 10 cols
[2021-05-08 09:14:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2021-05-08 09:14:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-08 09:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 09:14:26] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/30 places, 16/25 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-01a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3 1), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-01a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-01a-15 finished in 143 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620465268140

--------------------
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-01a"
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-01a, 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-162037989900370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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