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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
390.472 11663.00 21635.00 381.50 TFFFTTFTTFTFTFFT 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-162037990000417.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 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 29K 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-04a-00
FORMULA_NAME AutoFlight-PT-04a-01
FORMULA_NAME AutoFlight-PT-04a-02
FORMULA_NAME AutoFlight-PT-04a-03
FORMULA_NAME AutoFlight-PT-04a-04
FORMULA_NAME AutoFlight-PT-04a-05
FORMULA_NAME AutoFlight-PT-04a-06
FORMULA_NAME AutoFlight-PT-04a-07
FORMULA_NAME AutoFlight-PT-04a-08
FORMULA_NAME AutoFlight-PT-04a-09
FORMULA_NAME AutoFlight-PT-04a-10
FORMULA_NAME AutoFlight-PT-04a-11
FORMULA_NAME AutoFlight-PT-04a-12
FORMULA_NAME AutoFlight-PT-04a-13
FORMULA_NAME AutoFlight-PT-04a-14
FORMULA_NAME AutoFlight-PT-04a-15

=== Now, execution of the tool begins

BK_START 1620467504206

Running Version 0
[2021-05-08 09:51:46] [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 09:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:51:46] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-08 09:51:46] [INFO ] Transformed 107 places.
[2021-05-08 09:51:46] [INFO ] Transformed 105 transitions.
[2021-05-08 09:51:46] [INFO ] Found NUPN structural information;
[2021-05-08 09:51:46] [INFO ] Parsed PT model containing 107 places and 105 transitions in 113 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 09:51:46] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA AutoFlight-PT-04a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 107 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 107/107 places, 85/85 transitions.
Applied a total of 0 rules in 12 ms. Remains 107 /107 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 107 cols
[2021-05-08 09:51:46] [INFO ] Computed 28 place invariants in 13 ms
[2021-05-08 09:51:46] [INFO ] Implicit Places using invariants in 159 ms returned [21, 37, 62, 86, 92, 98, 104, 106]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 186 ms to find 8 implicit places.
// Phase 1: matrix 85 rows 99 cols
[2021-05-08 09:51:46] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-08 09:51:46] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 99/107 places, 85/85 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 96 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 96 transition count 82
Applied a total of 6 rules in 8 ms. Remains 96 /99 variables (removed 3) and now considering 82/85 (removed 3) transitions.
// Phase 1: matrix 82 rows 96 cols
[2021-05-08 09:51:46] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 09:51:46] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 82 rows 96 cols
[2021-05-08 09:51:46] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 09:51:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-08 09:51:46] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 96/107 places, 82/85 transitions.
[2021-05-08 09:51:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 09:51:47] [INFO ] Flatten gal took : 57 ms
FORMULA AutoFlight-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 09:51:47] [INFO ] Flatten gal took : 23 ms
[2021-05-08 09:51:47] [INFO ] Input system was already deterministic with 82 transitions.
Incomplete random walk after 100000 steps, including 3362 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 15) seen :13
Running SMT prover for 2 properties.
// Phase 1: matrix 82 rows 96 cols
[2021-05-08 09:51:47] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 09:51:47] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2021-05-08 09:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:51:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-08 09:51:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:51:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned unsat
[2021-05-08 09:51:47] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2021-05-08 09:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:51:47] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-08 09:51:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:51:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA AutoFlight-PT-04a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 96 cols
[2021-05-08 09:51:47] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 09:51:47] [INFO ] Implicit Places using invariants in 59 ms returned [7, 14, 27, 33, 38, 77]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
// Phase 1: matrix 82 rows 90 cols
[2021-05-08 09:51:47] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-08 09:51:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 90/96 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 78 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 78 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 77 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 77 transition count 69
Applied a total of 26 rules in 31 ms. Remains 77 /90 variables (removed 13) and now considering 69/82 (removed 13) transitions.
// Phase 1: matrix 69 rows 77 cols
[2021-05-08 09:51:48] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-08 09:51:48] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 69 rows 77 cols
[2021-05-08 09:51:48] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-08 09:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 09:51:48] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 77/96 places, 69/82 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s13 1)), p1:(OR (EQ s63 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33288 reset in 317 ms.
Product exploration explored 100000 steps with 33219 reset in 259 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33351 reset in 197 ms.
Product exploration explored 100000 steps with 33398 reset in 172 ms.
[2021-05-08 09:51:49] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:51:49] [INFO ] Flatten gal took : 4 ms
[2021-05-08 09:51:49] [INFO ] Time to serialize gal into /tmp/LTL4405841325306798263.gal : 2 ms
[2021-05-08 09:51:49] [INFO ] Time to serialize properties into /tmp/LTL5260214681523956271.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/LTL4405841325306798263.gal, -t, CGAL, -LTL, /tmp/LTL5260214681523956271.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/LTL4405841325306798263.gal -t CGAL -LTL /tmp/LTL5260214681523956271.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p31==0)||(p15==1))")U(X("((p88==0)||(p93==1))"))))))
Formula 0 simplified : !FG("((p31==0)||(p15==1))" U X"((p88==0)||(p93==1))")
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t11, t13, t15, t17, t19, t29, t33, t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/11/69
Computing Next relation with stutter on 8 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
31 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.32557,28188,1,0,150,56406,176,84,2278,59767,195
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-04a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-04a-01 finished in 2158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 81
Applied a total of 2 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 95 cols
[2021-05-08 09:51:50] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants in 44 ms returned [7, 14, 27, 30, 33, 38, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 45 ms to find 7 implicit places.
// Phase 1: matrix 81 rows 88 cols
[2021-05-08 09:51:50] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 88/96 places, 81/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 76 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 76 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 75 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 75 transition count 68
Applied a total of 26 rules in 15 ms. Remains 75 /88 variables (removed 13) and now considering 68/81 (removed 13) transitions.
// Phase 1: matrix 68 rows 75 cols
[2021-05-08 09:51:50] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 68 rows 75 cols
[2021-05-08 09:51:50] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 75/96 places, 68/82 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s55 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-04a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-02 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 67
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 75 transition count 62
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 70 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 44 place count 70 transition count 56
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 60 transition count 56
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 64 place count 60 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 68 place count 56 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 55 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 55 transition count 51
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 88 place count 46 transition count 42
Applied a total of 88 rules in 27 ms. Remains 46 /96 variables (removed 50) and now considering 42/82 (removed 40) transitions.
// Phase 1: matrix 42 rows 46 cols
[2021-05-08 09:51:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants in 32 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
[2021-05-08 09:51:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 45 cols
[2021-05-08 09:51:50] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 45/96 places, 42/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2021-05-08 09:51:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 45 cols
[2021-05-08 09:51:50] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 45/96 places, 42/82 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s18 1), p1:(OR (EQ s28 0) (EQ s16 1)), p0:(AND (EQ s20 1) (OR (EQ s30 0) (EQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-06 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 89 transition count 56
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 58 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 62 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 62 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 71 place count 55 transition count 50
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 55 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 53 transition count 48
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 52 transition count 47
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 52 transition count 47
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 95 place count 43 transition count 38
Applied a total of 95 rules in 8 ms. Remains 43 /96 variables (removed 53) and now considering 38/82 (removed 44) transitions.
// Phase 1: matrix 38 rows 43 cols
[2021-05-08 09:51:50] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants in 40 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
[2021-05-08 09:51:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 38 rows 42 cols
[2021-05-08 09:51:50] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 42/96 places, 38/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2021-05-08 09:51:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 42 cols
[2021-05-08 09:51:50] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/96 places, 38/82 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 0) (EQ s18 1) (OR (EQ s16 0) (EQ s35 1)) (OR (EQ s18 0) (EQ s24 1) (EQ s29 0) (EQ s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-09 finished in 249 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 81
Applied a total of 2 rules in 2 ms. Remains 95 /96 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 95 cols
[2021-05-08 09:51:50] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Implicit Places using invariants in 33 ms returned [14, 30, 33, 38, 77]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
// Phase 1: matrix 81 rows 90 cols
[2021-05-08 09:51:50] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-08 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 90/96 places, 81/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 72
Applied a total of 18 rules in 6 ms. Remains 81 /90 variables (removed 9) and now considering 72/81 (removed 9) transitions.
// Phase 1: matrix 72 rows 81 cols
[2021-05-08 09:51:50] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-08 09:51:51] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 72 rows 81 cols
[2021-05-08 09:51:51] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-08 09:51:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-08 09:51:51] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 81/96 places, 72/82 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-04a-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s26 1), p1:(AND (NEQ s13 0) (NEQ s66 1) (OR (EQ s7 0) (EQ s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04a-11 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 81
Applied a total of 2 rules in 1 ms. Remains 95 /96 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 95 cols
[2021-05-08 09:51:51] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-08 09:51:51] [INFO ] Implicit Places using invariants in 36 ms returned [7, 14, 27, 30, 33, 38, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 37 ms to find 7 implicit places.
// Phase 1: matrix 81 rows 88 cols
[2021-05-08 09:51:51] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-08 09:51:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 88/96 places, 81/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 85 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 84 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 78 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 78 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 77 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 77 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 76 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 76 transition count 69
Applied a total of 24 rules in 14 ms. Remains 76 /88 variables (removed 12) and now considering 69/81 (removed 12) transitions.
// Phase 1: matrix 69 rows 76 cols
[2021-05-08 09:51:51] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:51:51] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 69 rows 76 cols
[2021-05-08 09:51:51] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-08 09:51:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 76/96 places, 69/82 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 69/69 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 76 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 18 place count 76 transition count 69
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 76 transition count 69
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 34 place count 64 transition count 57
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 64 transition count 57
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 64 transition count 57
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 60 transition count 53
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 60 transition count 53
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 65 rules in 12 ms. Remains 60 /76 variables (removed 16) and now considering 53/69 (removed 16) transitions.
[2021-05-08 09:51:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 60 cols
[2021-05-08 09:51:52] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-08 09:51:52] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/76 places, 53/69 transitions.
Product exploration explored 100000 steps with 50000 reset in 355 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
[2021-05-08 09:51:52] [INFO ] Flatten gal took : 5 ms
[2021-05-08 09:51:52] [INFO ] Flatten gal took : 5 ms
[2021-05-08 09:51:53] [INFO ] Time to serialize gal into /tmp/LTL17312333503149742992.gal : 2 ms
[2021-05-08 09:51:53] [INFO ] Time to serialize properties into /tmp/LTL11197890100371956152.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/LTL17312333503149742992.gal, -t, CGAL, -LTL, /tmp/LTL11197890100371956152.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/LTL17312333503149742992.gal -t CGAL -LTL /tmp/LTL11197890100371956152.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p15==0)||(p75==1))"))))
Formula 0 simplified : !XF"((p15==0)||(p75==1))"
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t11, t13, t15, t17, t19, t29, t48, t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/11/69
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
22 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.22444,23344,1,0,138,40536,164,69,2145,31046,151
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-04a-12 finished in 2040 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 89 transition count 53
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 63 place count 61 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 60 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 64 place count 60 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 78 place count 51 transition count 47
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 82 place count 51 transition count 43
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 86 place count 47 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 46 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 46 transition count 42
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 108 place count 36 transition count 32
Applied a total of 108 rules in 9 ms. Remains 36 /96 variables (removed 60) and now considering 32/82 (removed 50) transitions.
// Phase 1: matrix 32 rows 36 cols
[2021-05-08 09:51:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-08 09:51:53] [INFO ] Implicit Places using invariants in 29 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
[2021-05-08 09:51:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 35 cols
[2021-05-08 09:51:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-08 09:51:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 35/96 places, 32/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-08 09:51:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 35 cols
[2021-05-08 09:51:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-08 09:51:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 35/96 places, 32/82 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6623 reset in 98 ms.
Product exploration explored 100000 steps with 6657 reset in 243 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6666 reset in 197 ms.
Product exploration explored 100000 steps with 6665 reset in 106 ms.
[2021-05-08 09:51:54] [INFO ] Flatten gal took : 4 ms
[2021-05-08 09:51:54] [INFO ] Flatten gal took : 2 ms
[2021-05-08 09:51:54] [INFO ] Time to serialize gal into /tmp/LTL2096160898007556023.gal : 1 ms
[2021-05-08 09:51:54] [INFO ] Time to serialize properties into /tmp/LTL16464499774578197191.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/LTL2096160898007556023.gal, -t, CGAL, -LTL, /tmp/LTL16464499774578197191.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/LTL2096160898007556023.gal -t CGAL -LTL /tmp/LTL16464499774578197191.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p69!=1)"))))
Formula 0 simplified : !GF"(p69!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 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.03159,16912,1,0,25,3045,24,14,819,2359,60
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-04a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-04a-15 finished in 1006 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620467515869

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

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