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-162037989700241.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AirplaneLD-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989700241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 49K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 227K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 190K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 90K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620455235102

Running Version 0
[2021-05-08 06:27:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 06:27:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 06:27:16] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-08 06:27:16] [INFO ] Transformed 89 places.
[2021-05-08 06:27:16] [INFO ] Transformed 88 transitions.
[2021-05-08 06:27:16] [INFO ] Found NUPN structural information;
[2021-05-08 06:27:16] [INFO ] Parsed PT model containing 89 places and 88 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 06:27:16] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 32 places and 0 transitions.
FORMULA AirplaneLD-PT-0010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 88
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 37 transition count 70
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 37 transition count 70
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 56 place count 37 transition count 52
Applied a total of 56 rules in 11 ms. Remains 37 /57 variables (removed 20) and now considering 52/88 (removed 36) transitions.
// Phase 1: matrix 52 rows 37 cols
[2021-05-08 06:27:16] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-08 06:27:16] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 52 rows 37 cols
[2021-05-08 06:27:16] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-08 06:27:16] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 52 rows 37 cols
[2021-05-08 06:27:16] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-08 06:27:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/57 places, 52/88 transitions.
[2021-05-08 06:27:17] [INFO ] Flatten gal took : 23 ms
[2021-05-08 06:27:17] [INFO ] Flatten gal took : 8 ms
[2021-05-08 06:27:17] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 100000 steps, including 12556 resets, run finished after 367 ms. (steps per millisecond=272 ) properties (out of 21) seen :18
Running SMT prover for 3 properties.
// Phase 1: matrix 52 rows 37 cols
[2021-05-08 06:27:17] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-08 06:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-08 06:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-08 06:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 06:27:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-08 06:27:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 06:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-08 06:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 06:27:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 61 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 27 transition count 43
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 27 transition count 43
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 28 place count 27 transition count 34
Applied a total of 28 rules in 7 ms. Remains 27 /37 variables (removed 10) and now considering 34/52 (removed 18) transitions.
// Phase 1: matrix 34 rows 27 cols
[2021-05-08 06:27:17] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-08 06:27:17] [INFO ] Implicit Places using invariants in 16 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-08 06:27:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 26 cols
[2021-05-08 06:27:17] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-08 06:27:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 26/37 places, 34/52 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 24 transition count 32
Applied a total of 4 rules in 3 ms. Remains 24 /26 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 24 cols
[2021-05-08 06:27:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:17] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 32 rows 24 cols
[2021-05-08 06:27:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/37 places, 32/52 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0010-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(AND (NEQ s11 0) (NEQ s19 1)), p2:(OR (EQ s21 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21233 reset in 316 ms.
Product exploration explored 100000 steps with 21331 reset in 174 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 32
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21228 reset in 125 ms.
Product exploration explored 100000 steps with 21412 reset in 133 ms.
[2021-05-08 06:27:19] [INFO ] Flatten gal took : 4 ms
[2021-05-08 06:27:19] [INFO ] Flatten gal took : 2 ms
[2021-05-08 06:27:19] [INFO ] Time to serialize gal into /tmp/LTL1130501957326436746.gal : 1 ms
[2021-05-08 06:27:19] [INFO ] Time to serialize properties into /tmp/LTL17258462473355517252.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/LTL1130501957326436746.gal, -t, CGAL, -LTL, /tmp/LTL17258462473355517252.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/LTL1130501957326436746.gal -t CGAL -LTL /tmp/LTL17258462473355517252.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+Speed_Left_Wheel_3)+Speed_Left_Wheel_4)+Speed_Left_Wheel_5)+Speed_Left_Wheel_6)+Speed_Left_Wheel_7)+Speed_Left_Wheel_8)+Speed_Left_Wheel_9)+Speed_Left_Wheel_10)<1)")&&(F(("((stp5!=0)&&(stp1!=1))")||(G("((P4==0)||(stp1==1))")))))))
Formula 0 simplified : !F("((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+Speed_Left_Wheel_3)+Speed_Left_Wheel_4)+Speed_Left_Wheel_5)+Speed_Left_Wheel_6)+Speed_Left_Wheel_7)+Speed_Left_Wheel_8)+Speed_Left_Wheel_9)+Speed_Left_Wheel_10)<1)" & F("((stp5!=0)&&(stp1!=1))" | G"((P4==0)||(stp1==1))"))
Reverse transition relation is NOT exact ! Due to transitions t26, t42, t43, t44, t45, t47, t49, t24.t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/24/8/32
Computing Next relation with stutter on 72 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 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.046071,17704,1,0,121,7030,106,72,721,8620,198
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AirplaneLD-PT-0010-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AirplaneLD-PT-0010-02 finished in 1446 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 52
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 19 transition count 35
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 19 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 52 place count 19 transition count 18
Applied a total of 52 rules in 2 ms. Remains 19 /37 variables (removed 18) and now considering 18/52 (removed 34) transitions.
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 26 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 18/37 places, 18/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/37 places, 18/52 transitions.
[2021-05-08 06:27:19] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0010-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s14 1), p0:(LEQ (ADD s12 s13) s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-05 finished in 141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(p1||X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 29 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 29 transition count 44
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 29 transition count 36
Applied a total of 24 rules in 2 ms. Remains 29 /37 variables (removed 8) and now considering 36/52 (removed 16) transitions.
// Phase 1: matrix 36 rows 29 cols
[2021-05-08 06:27:19] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 16 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
// Phase 1: matrix 36 rows 28 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 28/37 places, 36/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 28 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/37 places, 36/52 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : AirplaneLD-PT-0010-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), 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:(OR (EQ s3 0) (EQ s24 1)), p1:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13)), p2:(AND (GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13)) (OR (EQ s17 0) (EQ s17 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 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-07 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 20 transition count 35
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 20 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 51 place count 20 transition count 18
Applied a total of 51 rules in 2 ms. Remains 20 /37 variables (removed 17) and now considering 18/52 (removed 34) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-08 06:27:19] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 14 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-08 06:27:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 19/37 places, 18/52 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 19 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 17
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/37 places, 17/52 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s12 1), p2:(AND (NEQ s14 1) (NEQ s13 0) (NEQ s3 1)), p1:(AND (NEQ s13 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-09 finished in 150 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 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 61 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 19 transition count 35
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 19 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 52 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 18 transition count 17
Applied a total of 54 rules in 3 ms. Remains 18 /37 variables (removed 19) and now considering 17/52 (removed 35) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 14 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-08 06:27:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 17/37 places, 17/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 16
Applied a total of 2 rules in 3 ms. Remains 16 /17 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 40 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 15/37 places, 16/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 13 transition count 14
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 13 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 12 transition count 12
Applied a total of 7 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 12 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants and state equation in 12 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 24 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 11/37 places, 12/52 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 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 9 transition count 10
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 8 transition count 8
Applied a total of 7 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants and state equation in 9 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 21 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 7/37 places, 8/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 7
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 5 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 4 transition count 4
Applied a total of 7 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants and state equation in 7 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 15 ms to find 1 implicit places.
Starting structural reductions, iteration 5 : 3/37 places, 4/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-08 06:27:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 6 iterations. Remains : 3/37 places, 4/52 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-11 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 52
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 21 transition count 37
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 21 transition count 37
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 21 transition count 22
Applied a total of 46 rules in 1 ms. Remains 21 /37 variables (removed 16) and now considering 22/52 (removed 30) transitions.
// Phase 1: matrix 22 rows 21 cols
[2021-05-08 06:27:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:19] [INFO ] Implicit Places using invariants in 14 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 20 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 20/37 places, 22/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 20 cols
[2021-05-08 06:27:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/37 places, 22/52 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0010-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s4 1) (EQ s5 0) (EQ s2 1)), p0:(OR (EQ s5 0) (EQ s2 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 45209 reset in 85 ms.
Product exploration explored 100000 steps with 45049 reset in 110 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (OR (G p0) (G (NOT p0)))), p1, p0]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA AirplaneLD-PT-0010-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property AirplaneLD-PT-0010-13 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 61 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 19 transition count 35
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 19 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 52 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 18 transition count 17
Applied a total of 54 rules in 2 ms. Remains 18 /37 variables (removed 19) and now considering 17/52 (removed 35) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 11 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-08 06:27:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-08 06:27:20] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 17/37 places, 17/52 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 15
Applied a total of 4 rules in 1 ms. Remains 15 /17 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants and state equation in 13 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 36 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 14/37 places, 15/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 11
Applied a total of 7 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants and state equation in 11 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 19 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 10/37 places, 11/52 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 8 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 8 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 7 transition count 7
Applied a total of 7 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants and state equation in 9 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 16 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 6/37 places, 7/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-08 06:27:20] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
Finished structural reductions, in 5 iterations. Remains : 5/37 places, 6/52 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-14 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: 1}]], initial=1, aps=[p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-14 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 61 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 19 transition count 35
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 19 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 52 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 18 transition count 17
Applied a total of 54 rules in 2 ms. Remains 18 /37 variables (removed 19) and now considering 17/52 (removed 35) transitions.
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:20] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2021-05-08 06:27:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 27 ms to find 1 implicit places.
[2021-05-08 06:27:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 06:27:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 17/37 places, 17/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2021-05-08 06:27:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 17 cols
[2021-05-08 06:27:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-08 06:27:20] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 17/37 places, 17/52 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s12 0) (NEQ s16 1)), p0:(OR (EQ s16 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14413 reset in 76 ms.
Product exploration explored 100000 steps with 14432 reset in 87 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 17
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 14448 reset in 75 ms.
Product exploration explored 100000 steps with 14422 reset in 84 ms.
[2021-05-08 06:27:21] [INFO ] Flatten gal took : 2 ms
[2021-05-08 06:27:21] [INFO ] Flatten gal took : 1 ms
[2021-05-08 06:27:21] [INFO ] Time to serialize gal into /tmp/LTL6426862036166316049.gal : 0 ms
[2021-05-08 06:27:21] [INFO ] Time to serialize properties into /tmp/LTL10380859947210224008.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/LTL6426862036166316049.gal, -t, CGAL, -LTL, /tmp/LTL10380859947210224008.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/LTL6426862036166316049.gal -t CGAL -LTL /tmp/LTL10380859947210224008.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("((P1==0)||(P5==1))")))||(G("((P5!=0)||(P1!=1))"))))
Formula 0 simplified : !(FG"((P1==0)||(P5==1))" | G"((P5!=0)||(P1!=1))")
Reverse transition relation is NOT exact ! Due to transitions t42, t47, t49, t51, t19.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/5/17
Computing Next relation with stutter on 15 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.024705,17356,1,0,95,3311,70,66,450,5332,186
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AirplaneLD-PT-0010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AirplaneLD-PT-0010-15 finished in 697 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620455242265

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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