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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
646.363 14645.00 25505.00 171.10 FFTTTTFFFTFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990000433.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-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.4K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 36K 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-05a-00
FORMULA_NAME AutoFlight-PT-05a-01
FORMULA_NAME AutoFlight-PT-05a-02
FORMULA_NAME AutoFlight-PT-05a-03
FORMULA_NAME AutoFlight-PT-05a-04
FORMULA_NAME AutoFlight-PT-05a-05
FORMULA_NAME AutoFlight-PT-05a-06
FORMULA_NAME AutoFlight-PT-05a-07
FORMULA_NAME AutoFlight-PT-05a-08
FORMULA_NAME AutoFlight-PT-05a-09
FORMULA_NAME AutoFlight-PT-05a-10
FORMULA_NAME AutoFlight-PT-05a-11
FORMULA_NAME AutoFlight-PT-05a-12
FORMULA_NAME AutoFlight-PT-05a-13
FORMULA_NAME AutoFlight-PT-05a-14
FORMULA_NAME AutoFlight-PT-05a-15

=== Now, execution of the tool begins

BK_START 1620469122064

Running Version 0
[2021-05-08 10:18:43] [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 10:18:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:18:43] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-08 10:18:43] [INFO ] Transformed 132 places.
[2021-05-08 10:18:43] [INFO ] Transformed 130 transitions.
[2021-05-08 10:18:43] [INFO ] Found NUPN structural information;
[2021-05-08 10:18:43] [INFO ] Parsed PT model containing 132 places and 130 transitions in 87 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 10:18:43] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 132 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 16 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2021-05-08 10:18:43] [INFO ] Computed 34 place invariants in 15 ms
[2021-05-08 10:18:44] [INFO ] Implicit Places using invariants in 243 ms returned [7, 14, 21, 28, 35, 41, 44, 47, 50, 99, 105, 111, 117, 123, 129, 131]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 271 ms to find 16 implicit places.
// Phase 1: matrix 105 rows 116 cols
[2021-05-08 10:18:44] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-08 10:18:44] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 116/132 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 102
Applied a total of 6 rules in 14 ms. Remains 113 /116 variables (removed 3) and now considering 102/105 (removed 3) transitions.
// Phase 1: matrix 102 rows 113 cols
[2021-05-08 10:18:44] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-08 10:18:44] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 102 rows 113 cols
[2021-05-08 10:18:44] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-08 10:18:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 10:18:44] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 113/132 places, 102/105 transitions.
[2021-05-08 10:18:44] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 10:18:44] [INFO ] Flatten gal took : 62 ms
FORMULA AutoFlight-PT-05a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:18:44] [INFO ] Flatten gal took : 33 ms
[2021-05-08 10:18:44] [INFO ] Input system was already deterministic with 102 transitions.
Incomplete random walk after 100000 steps, including 3030 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 15) seen :14
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 113 cols
[2021-05-08 10:18:44] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-08 10:18:45] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2021-05-08 10:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:18:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-08 10:18:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:18:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2021-05-08 10:18:45] [INFO ] Initial state test concluded for 1 properties.
FORMULA AutoFlight-PT-05a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 102/102 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 113 transition count 66
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 77 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 76 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 74 place count 76 transition count 59
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 70 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 69 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 69 transition count 58
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 110 place count 58 transition count 47
Applied a total of 110 rules in 28 ms. Remains 58 /113 variables (removed 55) and now considering 47/102 (removed 55) transitions.
// Phase 1: matrix 47 rows 58 cols
[2021-05-08 10:18:45] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-08 10:18:45] [INFO ] Implicit Places using invariants in 50 ms returned [22, 23, 24, 25, 26, 27, 33]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 56 ms to find 7 implicit places.
[2021-05-08 10:18:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-08 10:18:45] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-08 10:18:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 51/113 places, 47/102 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 51 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 45 transition count 41
Applied a total of 12 rules in 4 ms. Remains 45 /51 variables (removed 6) and now considering 41/47 (removed 6) transitions.
// Phase 1: matrix 41 rows 45 cols
[2021-05-08 10:18:45] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 10:18:45] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 41 rows 45 cols
[2021-05-08 10:18:45] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-08 10:18:45] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-08 10:18:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/113 places, 41/102 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s21 1), p0:(AND (EQ s21 0) (OR (EQ s27 0) (EQ s27 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
[2021-05-08 10:18:46] [INFO ] Flatten gal took : 3 ms
[2021-05-08 10:18:46] [INFO ] Flatten gal took : 3 ms
[2021-05-08 10:18:46] [INFO ] Time to serialize gal into /tmp/LTL17821586408301697651.gal : 2 ms
[2021-05-08 10:18:46] [INFO ] Time to serialize properties into /tmp/LTL11031269717646928505.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17821586408301697651.gal, -t, CGAL, -LTL, /tmp/LTL11031269717646928505.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/LTL17821586408301697651.gal -t CGAL -LTL /tmp/LTL11031269717646928505.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p34==0)&&((p81==0)||(p81==1)))"))||(F("(p34==1)"))))
Formula 0 simplified : !(G"((p34==0)&&((p81==0)||(p81==1)))" | F"(p34==1)")
Reverse transition relation is NOT exact ! Due to transitions t6, t46.t47.t48.t93, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/2/41
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
6 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.061674,18008,1,0,88,9441,109,42,1305,6490,103
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-05a-02 finished in 1501 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 100
Applied a total of 4 rules in 10 ms. Remains 111 /113 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:18:46] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-08 10:18:46] [INFO ] Implicit Places using invariants in 51 ms returned [33, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
// Phase 1: matrix 100 rows 109 cols
[2021-05-08 10:18:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 10:18:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 109/113 places, 100/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 95 transition count 86
Applied a total of 28 rules in 36 ms. Remains 95 /109 variables (removed 14) and now considering 86/100 (removed 14) transitions.
// Phase 1: matrix 86 rows 95 cols
[2021-05-08 10:18:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 10:18:46] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 86 rows 95 cols
[2021-05-08 10:18:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-08 10:18:46] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 95/113 places, 86/102 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s55 0) (EQ s18 1)), p0:(OR (EQ s71 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 95/95 places, 86/86 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 95 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 95 transition count 86
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 95 transition count 86
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 43 place count 80 transition count 71
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 80 transition count 71
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 80 transition count 71
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 76 transition count 67
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 76 transition count 67
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 77 rules in 12 ms. Remains 76 /95 variables (removed 19) and now considering 67/86 (removed 19) transitions.
[2021-05-08 10:18:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 76 cols
[2021-05-08 10:18:47] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/95 places, 67/86 transitions.
Product exploration explored 100000 steps with 50000 reset in 564 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
[2021-05-08 10:18:49] [INFO ] Flatten gal took : 5 ms
[2021-05-08 10:18:49] [INFO ] Flatten gal took : 6 ms
[2021-05-08 10:18:49] [INFO ] Time to serialize gal into /tmp/LTL16820427790628838964.gal : 11 ms
[2021-05-08 10:18:49] [INFO ] Time to serialize properties into /tmp/LTL16714459543902552471.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16820427790628838964.gal, -t, CGAL, -LTL, /tmp/LTL16714459543902552471.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/LTL16820427790628838964.gal -t CGAL -LTL /tmp/LTL16714459543902552471.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((p96==0)||(p12==1))"))||(F("((p65==0)||(p20==1))")))))
Formula 0 simplified : !X(G"((p96==0)||(p12==1))" | F"((p65==0)||(p20==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t40, t63, t82, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/73/13/86
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
37 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.381113,28384,1,0,168,65196,201,85,2687,48416,186
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-05a-04 finished in 2837 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(p0)&&F((G(p1)&&X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 113 cols
[2021-05-08 10:18:49] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-08 10:18:49] [INFO ] Implicit Places using invariants in 30 ms returned [33, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 102 rows 111 cols
[2021-05-08 10:18:49] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-08 10:18:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 111/113 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 101
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 110 cols
[2021-05-08 10:18:49] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:49] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 101 rows 110 cols
[2021-05-08 10:18:49] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 110/113 places, 101/102 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s71 0) (EQ s9 1)), p0:(OR (EQ s67 0) (EQ s92 1)), p2:(AND (EQ s35 0) (EQ s90 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]]
Stuttering criterion allowed to conclude after 218 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-05a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-07 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 113/113 places, 102/102 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 113 transition count 63
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 74 transition count 63
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 78 place count 74 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 69 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 67 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 67 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 114 place count 56 transition count 45
Applied a total of 114 rules in 9 ms. Remains 56 /113 variables (removed 57) and now considering 45/102 (removed 57) transitions.
// Phase 1: matrix 45 rows 56 cols
[2021-05-08 10:18:50] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants in 31 ms returned [22, 23, 24, 25, 26, 27, 33]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 32 ms to find 7 implicit places.
[2021-05-08 10:18:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2021-05-08 10:18:50] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 10:18:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 49/113 places, 45/102 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 49 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 44 transition count 40
Applied a total of 10 rules in 4 ms. Remains 44 /49 variables (removed 5) and now considering 40/45 (removed 5) transitions.
// Phase 1: matrix 40 rows 44 cols
[2021-05-08 10:18:50] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 40 rows 44 cols
[2021-05-08 10:18:50] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 10:18:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants and state equation in 33 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 : 44/113 places, 40/102 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s39 0) (EQ s19 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 59 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-05a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-08 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((G(p1) U (p2 U G(p3)))||p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 113/113 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 100
Applied a total of 4 rules in 1 ms. Remains 111 /113 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 111 cols
[2021-05-08 10:18:50] [INFO ] Computed 18 place invariants in 0 ms
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants in 78 ms returned [33, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
// Phase 1: matrix 100 rows 109 cols
[2021-05-08 10:18:50] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 109/113 places, 100/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 96
Applied a total of 8 rules in 4 ms. Remains 105 /109 variables (removed 4) and now considering 96/100 (removed 4) transitions.
// Phase 1: matrix 96 rows 105 cols
[2021-05-08 10:18:50] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 96 rows 105 cols
[2021-05-08 10:18:50] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:50] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 105/113 places, 96/102 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-05a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s67 0) (EQ s38 1)), p3:(OR (EQ s67 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Knowledge obtained : [p0, p3]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 105/105 places, 96/96 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 105 transition count 96
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 32 place count 105 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 105 transition count 96
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 62 place count 80 transition count 71
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 87 place count 80 transition count 71
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 100 place count 80 transition count 71
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 76 transition count 67
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 76 transition count 67
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 108 rules in 8 ms. Remains 76 /105 variables (removed 29) and now considering 67/96 (removed 29) transitions.
[2021-05-08 10:18:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 76 cols
[2021-05-08 10:18:51] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 10:18:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/105 places, 67/96 transitions.
Product exploration explored 100000 steps with 50000 reset in 469 ms.
Product exploration explored 100000 steps with 50000 reset in 425 ms.
Starting structural reductions, iteration 0 : 105/105 places, 96/96 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 99 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 99 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 93 transition count 84
Applied a total of 24 rules in 9 ms. Remains 93 /105 variables (removed 12) and now considering 84/96 (removed 12) transitions.
// Phase 1: matrix 84 rows 93 cols
[2021-05-08 10:18:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:52] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 84 rows 93 cols
[2021-05-08 10:18:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-08 10:18:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 93 cols
[2021-05-08 10:18:52] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-08 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 84/96 transitions.
[2021-05-08 10:18:52] [INFO ] Flatten gal took : 6 ms
[2021-05-08 10:18:52] [INFO ] Flatten gal took : 7 ms
[2021-05-08 10:18:52] [INFO ] Time to serialize gal into /tmp/LTL12879595763394515784.gal : 10 ms
[2021-05-08 10:18:52] [INFO ] Time to serialize properties into /tmp/LTL6028384282897216995.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/LTL12879595763394515784.gal, -t, CGAL, -LTL, /tmp/LTL6028384282897216995.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/LTL12879595763394515784.gal -t CGAL -LTL /tmp/LTL6028384282897216995.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(F(("((p82==0)||(p46==1))")||((G("(((p126==0)||(p119==1))||((p46==0)&&(p82==1)))"))U(("((p126==0)||(p119==1))")U(G("((p82==0)||(p46==1))"))))))))
Formula 0 simplified : !XF("((p82==0)||(p46==1))" | (G"(((p126==0)||(p119==1))||((p46==0)&&(p82==1)))" U ("((p126==0)||(p119==1))" U G"((p82==0)||(p46==1))")))
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t92, t93, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/12/102
Computing Next relation with stutter on 10 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
52 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.533683,34568,1,0,181,94019,230,101,3139,67764,217
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(X(X(F("((p67==0)&&(p38==1))"))))))
Formula 1 simplified : !XXXF"((p67==0)&&(p38==1))"
Computing Next relation with stutter on 10 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 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.538629,34808,1,0,183,94851,239,103,3145,68131,227
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA AutoFlight-PT-05a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F("(p96==1)"))))
Formula 2 simplified : !XF"(p96==1)"
Computing Next relation with stutter on 10 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
219 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.73516,107104,1,0,349,475549,248,327,3147,573595,639
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-05a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-05a-09 finished in 5589 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620469136709

--------------------
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="AutoFlight-PT-05a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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