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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1109.039 103617.00 135228.00 711.70 TFTFTTFTFTFTTFFF 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-162037990000457.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-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K 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.7K Mar 22 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K 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-06b-00
FORMULA_NAME AutoFlight-PT-06b-01
FORMULA_NAME AutoFlight-PT-06b-02
FORMULA_NAME AutoFlight-PT-06b-03
FORMULA_NAME AutoFlight-PT-06b-04
FORMULA_NAME AutoFlight-PT-06b-05
FORMULA_NAME AutoFlight-PT-06b-06
FORMULA_NAME AutoFlight-PT-06b-07
FORMULA_NAME AutoFlight-PT-06b-08
FORMULA_NAME AutoFlight-PT-06b-09
FORMULA_NAME AutoFlight-PT-06b-10
FORMULA_NAME AutoFlight-PT-06b-11
FORMULA_NAME AutoFlight-PT-06b-12
FORMULA_NAME AutoFlight-PT-06b-13
FORMULA_NAME AutoFlight-PT-06b-14
FORMULA_NAME AutoFlight-PT-06b-15

=== Now, execution of the tool begins

BK_START 1620470505132

Running Version 0
[2021-05-08 10:41: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 10:41:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:41:46] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-08 10:41:46] [INFO ] Transformed 574 places.
[2021-05-08 10:41:46] [INFO ] Transformed 572 transitions.
[2021-05-08 10:41:46] [INFO ] Found NUPN structural information;
[2021-05-08 10:41:46] [INFO ] Parsed PT model containing 574 places and 572 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 10:41:46] [INFO ] Initial state test concluded for 3 properties.
FORMULA AutoFlight-PT-06b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 501 transition count 499
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 501 transition count 499
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 158 place count 501 transition count 487
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 188 place count 471 transition count 457
Iterating global reduction 1 with 30 rules applied. Total rules applied 218 place count 471 transition count 457
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 223 place count 466 transition count 452
Iterating global reduction 1 with 5 rules applied. Total rules applied 228 place count 466 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 233 place count 461 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 238 place count 461 transition count 447
Applied a total of 238 rules in 159 ms. Remains 461 /574 variables (removed 113) and now considering 447/572 (removed 125) transitions.
// Phase 1: matrix 447 rows 461 cols
[2021-05-08 10:41:47] [INFO ] Computed 40 place invariants in 24 ms
[2021-05-08 10:41:47] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 447 rows 461 cols
[2021-05-08 10:41:47] [INFO ] Computed 40 place invariants in 6 ms
[2021-05-08 10:41:47] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 461 cols
[2021-05-08 10:41:47] [INFO ] Computed 40 place invariants in 6 ms
[2021-05-08 10:41:47] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Finished structural reductions, in 1 iterations. Remains : 461/574 places, 447/572 transitions.
[2021-05-08 10:41:47] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 10:41:48] [INFO ] Flatten gal took : 70 ms
FORMULA AutoFlight-PT-06b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 10:41:48] [INFO ] Flatten gal took : 30 ms
[2021-05-08 10:41:48] [INFO ] Input system was already deterministic with 447 transitions.
Incomplete random walk after 100000 steps, including 345 resets, run finished after 382 ms. (steps per millisecond=261 ) properties (out of 12) seen :7
Running SMT prover for 5 properties.
// Phase 1: matrix 447 rows 461 cols
[2021-05-08 10:41:48] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-08 10:41:48] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2021-05-08 10:41:48] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:48] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-08 10:41:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:41:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned unsat
[2021-05-08 10:41:48] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2021-05-08 10:41:48] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 10:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:49] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-08 10:41:49] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
[2021-05-08 10:41:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2021-05-08 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2021-05-08 10:41:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:41:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 10:41:49] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:49] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-08 10:41:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2021-05-08 10:41:49] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2021-05-08 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2021-05-08 10:41:49] [INFO ] Computed and/alt/rep : 446/630/446 causal constraints (skipped 0 transitions) in 42 ms.
[2021-05-08 10:41:51] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2021-05-08 10:41:51] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2021-05-08 10:41:52] [INFO ] Added : 427 causal constraints over 86 iterations in 2458 ms. Result :sat
[2021-05-08 10:41:52] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:41:52] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:52] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-08 10:41:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:41:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2021-05-08 10:41:52] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 0 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2021-05-08 10:41:52] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2021-05-08 10:41:53] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2021-05-08 10:41:53] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2021-05-08 10:41:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 658 ms
[2021-05-08 10:41:53] [INFO ] Computed and/alt/rep : 446/630/446 causal constraints (skipped 0 transitions) in 40 ms.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 1 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 0 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 0 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2021-05-08 10:41:55] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2021-05-08 10:41:56] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 1 ms to minimize.
[2021-05-08 10:41:56] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2021-05-08 10:41:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 981 ms
[2021-05-08 10:41:56] [INFO ] Added : 445 causal constraints over 89 iterations in 3150 ms. Result :sat
[2021-05-08 10:41:56] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2021-05-08 10:41:56] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:56] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-08 10:41:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:41:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2021-05-08 10:41:56] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:41:56] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-08 10:41:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2021-05-08 10:41:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2021-05-08 10:41:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 0 ms to minimize.
[2021-05-08 10:41:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 898 ms
[2021-05-08 10:41:57] [INFO ] Computed and/alt/rep : 446/630/446 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-08 10:41:59] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2021-05-08 10:41:59] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2021-05-08 10:42:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2021-05-08 10:42:00] [INFO ] Added : 441 causal constraints over 89 iterations in 2474 ms. Result :sat
[2021-05-08 10:42:00] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 10:42:00] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:42:00] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-08 10:42:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:42:00] [INFO ] [Nat]Absence check using 39 positive place invariants in 28 ms returned sat
[2021-05-08 10:42:00] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:42:00] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-08 10:42:00] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 5 ms to minimize.
[2021-05-08 10:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-08 10:42:00] [INFO ] Computed and/alt/rep : 446/630/446 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-08 10:42:02] [INFO ] Added : 416 causal constraints over 84 iterations in 2242 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 460 transition count 290
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 174 rules applied. Total rules applied 330 place count 304 transition count 272
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 342 place count 292 transition count 272
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 342 place count 292 transition count 215
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 456 place count 235 transition count 215
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 463 place count 228 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 470 place count 228 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 470 place count 228 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 480 place count 223 transition count 203
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 656 place count 135 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 657 place count 134 transition count 102
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 14 rules applied. Total rules applied 671 place count 124 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 675 place count 120 transition count 98
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 675 place count 120 transition count 92
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 687 place count 114 transition count 92
Applied a total of 687 rules in 93 ms. Remains 114 /461 variables (removed 347) and now considering 92/447 (removed 355) transitions.
// Phase 1: matrix 92 rows 114 cols
[2021-05-08 10:42:03] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-08 10:42:03] [INFO ] Implicit Places using invariants in 64 ms returned [46, 66, 86, 90, 94, 98, 102, 107, 113]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 67 ms to find 9 implicit places.
[2021-05-08 10:42:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 105 cols
[2021-05-08 10:42:03] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:42:03] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 105/461 places, 92/447 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 85
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 95 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 94 transition count 81
Applied a total of 22 rules in 16 ms. Remains 94 /105 variables (removed 11) and now considering 81/92 (removed 11) transitions.
// Phase 1: matrix 81 rows 94 cols
[2021-05-08 10:42:03] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-08 10:42:03] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 81 rows 94 cols
[2021-05-08 10:42:03] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-08 10:42:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:42:03] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 94/461 places, 81/447 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s64 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-01 finished in 514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 455 transition count 441
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 455 transition count 441
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 452 transition count 438
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 452 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 451 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 451 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 450 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 450 transition count 436
Applied a total of 22 rules in 108 ms. Remains 450 /461 variables (removed 11) and now considering 436/447 (removed 11) transitions.
// Phase 1: matrix 436 rows 450 cols
[2021-05-08 10:42:03] [INFO ] Computed 40 place invariants in 4 ms
[2021-05-08 10:42:03] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 436 rows 450 cols
[2021-05-08 10:42:03] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-08 10:42:03] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 450 cols
[2021-05-08 10:42:03] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:42:04] [INFO ] Dead Transitions using invariants and state equation in 190 ms returned []
Finished structural reductions, in 1 iterations. Remains : 450/461 places, 436/447 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s78 1), p0:(OR (EQ s95 0) (EQ s150 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 468 ms.
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 450 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 450/450 places, 436/436 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 450 transition count 436
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 152 place count 450 transition count 430
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 152 place count 450 transition count 461
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 211 place count 450 transition count 461
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 322 place count 339 transition count 350
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 433 place count 339 transition count 350
Performed 106 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 539 place count 339 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 540 place count 339 transition count 339
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 609 place count 270 transition count 270
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 3 with 69 rules applied. Total rules applied 678 place count 270 transition count 270
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 678 rules in 79 ms. Remains 270 /450 variables (removed 180) and now considering 270/436 (removed 166) transitions.
[2021-05-08 10:42:06] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 270 rows 270 cols
[2021-05-08 10:42:06] [INFO ] Computed 40 place invariants in 3 ms
[2021-05-08 10:42:06] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 270/450 places, 270/436 transitions.
Product exploration explored 100000 steps with 50000 reset in 1347 ms.
Product exploration explored 100000 steps with 50000 reset in 1221 ms.
[2021-05-08 10:42:09] [INFO ] Flatten gal took : 50 ms
[2021-05-08 10:42:09] [INFO ] Flatten gal took : 22 ms
[2021-05-08 10:42:09] [INFO ] Time to serialize gal into /tmp/LTL13558931017655600935.gal : 19 ms
[2021-05-08 10:42:09] [INFO ] Time to serialize properties into /tmp/LTL5683286786499475717.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/LTL13558931017655600935.gal, -t, CGAL, -LTL, /tmp/LTL5683286786499475717.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/LTL13558931017655600935.gal -t CGAL -LTL /tmp/LTL5683286786499475717.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p134==0)||(p228==1))"))||(X(F("(p110!=1)")))))
Formula 0 simplified : !(G"((p134==0)||(p228==1))" | XF"(p110!=1)")
Detected timeout of ITS tools.
[2021-05-08 10:42:24] [INFO ] Flatten gal took : 21 ms
[2021-05-08 10:42:24] [INFO ] Applying decomposition
[2021-05-08 10:42:24] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12956506909221424935.txt, -o, /tmp/graph12956506909221424935.bin, -w, /tmp/graph12956506909221424935.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12956506909221424935.bin, -l, -1, -v, -w, /tmp/graph12956506909221424935.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:42:24] [INFO ] Decomposing Gal with order
[2021-05-08 10:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:42:24] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-08 10:42:24] [INFO ] Flatten gal took : 61 ms
[2021-05-08 10:42:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-08 10:42:24] [INFO ] Time to serialize gal into /tmp/LTL11429138195542461311.gal : 9 ms
[2021-05-08 10:42:24] [INFO ] Time to serialize properties into /tmp/LTL7290751129446519131.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/LTL11429138195542461311.gal, -t, CGAL, -LTL, /tmp/LTL7290751129446519131.ltl, -c, -stutter-deadlock], 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/LTL11429138195542461311.gal -t CGAL -LTL /tmp/LTL7290751129446519131.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("((i4.u39.p134==0)||(i10.u66.p228==1))"))||(X(F("(i5.u34.p110!=1)")))))
Formula 0 simplified : !(G"((i4.u39.p134==0)||(i10.u66.p228==1))" | XF"(i5.u34.p110!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin134999749715030302
[2021-05-08 10:42:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin134999749715030302
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin134999749715030302]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin134999749715030302] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin134999749715030302] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-06b-04 finished in 37213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 460 transition count 292
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 172 rules applied. Total rules applied 326 place count 306 transition count 274
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 339 place count 294 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 340 place count 293 transition count 273
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 340 place count 293 transition count 216
Deduced a syphon composed of 57 places in 14 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 454 place count 236 transition count 216
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 460 place count 230 transition count 210
Iterating global reduction 4 with 6 rules applied. Total rules applied 466 place count 230 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 466 place count 230 transition count 206
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 474 place count 226 transition count 206
Performed 89 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 652 place count 137 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 136 transition count 104
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 667 place count 126 transition count 100
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 671 place count 122 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 671 place count 122 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 683 place count 116 transition count 94
Applied a total of 683 rules in 61 ms. Remains 116 /461 variables (removed 345) and now considering 94/447 (removed 353) transitions.
// Phase 1: matrix 94 rows 116 cols
[2021-05-08 10:42:40] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-08 10:42:40] [INFO ] Implicit Places using invariants in 76 ms returned [48, 68, 88, 92, 96, 100, 104, 109, 115]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 77 ms to find 9 implicit places.
[2021-05-08 10:42:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 94 rows 107 cols
[2021-05-08 10:42:40] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:42:40] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 107/461 places, 94/447 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 87
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 99 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 94 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 93 transition count 80
Applied a total of 28 rules in 19 ms. Remains 93 /107 variables (removed 14) and now considering 80/94 (removed 14) transitions.
// Phase 1: matrix 80 rows 93 cols
[2021-05-08 10:42:40] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:42:40] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 80 rows 93 cols
[2021-05-08 10:42:40] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-08 10:42:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 10:42:40] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 93/461 places, 80/447 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s29 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 22 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-06 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((!p0||X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 454 transition count 440
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 454 transition count 440
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 450 transition count 436
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 449 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 448 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 448 transition count 434
Applied a total of 26 rules in 44 ms. Remains 448 /461 variables (removed 13) and now considering 434/447 (removed 13) transitions.
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:42:41] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 10:42:41] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:42:41] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:42:41] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:42:41] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:42:41] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/461 places, 434/447 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), false, false, true]
Running random walk in product with property : AutoFlight-PT-06b-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s227 0) (NEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19096 steps with 65 reset in 60 ms.
FORMULA AutoFlight-PT-06b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-08 finished in 742 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 460 transition count 292
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 172 rules applied. Total rules applied 326 place count 306 transition count 274
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 338 place count 294 transition count 274
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 338 place count 294 transition count 216
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 454 place count 236 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 458 place count 232 transition count 212
Iterating global reduction 3 with 4 rules applied. Total rules applied 462 place count 232 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 462 place count 232 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 468 place count 229 transition count 209
Performed 88 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 644 place count 141 transition count 110
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 645 place count 141 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 140 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 140 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 140 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 649 place count 139 transition count 107
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 663 place count 129 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 667 place count 125 transition count 103
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 667 place count 125 transition count 97
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 679 place count 119 transition count 97
Applied a total of 679 rules in 41 ms. Remains 119 /461 variables (removed 342) and now considering 97/447 (removed 350) transitions.
// Phase 1: matrix 97 rows 119 cols
[2021-05-08 10:42:41] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-08 10:42:41] [INFO ] Implicit Places using invariants in 99 ms returned [51, 71, 91, 95, 99, 103, 107, 112, 118]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 100 ms to find 9 implicit places.
[2021-05-08 10:42:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 110 cols
[2021-05-08 10:42:41] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-08 10:42:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 110/461 places, 97/447 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 103 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 103 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 102 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 101 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 100 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 100 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 99 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 97 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 96 transition count 83
Applied a total of 28 rules in 10 ms. Remains 96 /110 variables (removed 14) and now considering 83/97 (removed 14) transitions.
// Phase 1: matrix 83 rows 96 cols
[2021-05-08 10:42:41] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:42:42] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 83 rows 96 cols
[2021-05-08 10:42:42] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:42:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 10:42:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 96/461 places, 83/447 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s5 1) (EQ s69 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3692 reset in 182 ms.
Product exploration explored 100000 steps with 3717 reset in 225 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3717 reset in 172 ms.
Product exploration explored 100000 steps with 3711 reset in 312 ms.
[2021-05-08 10:42:43] [INFO ] Flatten gal took : 18 ms
[2021-05-08 10:42:43] [INFO ] Flatten gal took : 3 ms
[2021-05-08 10:42:43] [INFO ] Time to serialize gal into /tmp/LTL12761181248202136364.gal : 1 ms
[2021-05-08 10:42:43] [INFO ] Time to serialize properties into /tmp/LTL16313773014940363671.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/LTL12761181248202136364.gal, -t, CGAL, -LTL, /tmp/LTL16313773014940363671.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/LTL12761181248202136364.gal -t CGAL -LTL /tmp/LTL16313773014940363671.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p33==0)||(p46==1))||(p449==0))||(p185==1))"))))
Formula 0 simplified : !FG"((((p33==0)||(p46==1))||(p449==0))||(p185==1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t265, t4.t338.t333.t365.t332.t335.t36.t135.t435.t37, t260.t256.t356.t257.t255.t36.t135.t435.t37, t232.t233.t234.t409.t235.t19.t36.t135.t435.t37, t348.t364.t349.t36.t135.t435.t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/6/83
Computing Next relation with stutter on 5632 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
242 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.43893,102492,1,0,542,416893,196,582,2657,773363,1098
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-06b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-06b-10 finished in 4362 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 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 452 transition count 438
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 452 transition count 438
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 448 transition count 434
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 447 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 447 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 446 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 446 transition count 432
Applied a total of 30 rules in 41 ms. Remains 446 /461 variables (removed 15) and now considering 432/447 (removed 15) transitions.
// Phase 1: matrix 432 rows 446 cols
[2021-05-08 10:42:46] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 10:42:46] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 432 rows 446 cols
[2021-05-08 10:42:46] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:42:46] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 432 rows 446 cols
[2021-05-08 10:42:46] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 10:42:46] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 446/461 places, 432/447 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-11 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 s287 0) (EQ s195 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 376 ms.
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 446/446 places, 432/432 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 446 transition count 432
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 152 place count 446 transition count 426
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 152 place count 446 transition count 459
Deduced a syphon composed of 204 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 210 place count 446 transition count 459
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 321 place count 335 transition count 348
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 432 place count 335 transition count 348
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 108 rules applied. Total rules applied 540 place count 335 transition count 336
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 610 place count 265 transition count 266
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 680 place count 265 transition count 266
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 680 rules in 56 ms. Remains 265 /446 variables (removed 181) and now considering 266/432 (removed 166) transitions.
[2021-05-08 10:42:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 266 rows 265 cols
[2021-05-08 10:42:48] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:42:48] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 265/446 places, 266/432 transitions.
Product exploration explored 100000 steps with 50000 reset in 1247 ms.
Product exploration explored 100000 steps with 50000 reset in 1219 ms.
[2021-05-08 10:42:51] [INFO ] Flatten gal took : 13 ms
[2021-05-08 10:42:51] [INFO ] Flatten gal took : 13 ms
[2021-05-08 10:42:51] [INFO ] Time to serialize gal into /tmp/LTL13662898353084276588.gal : 2 ms
[2021-05-08 10:42:51] [INFO ] Time to serialize properties into /tmp/LTL2076647639284268752.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/LTL13662898353084276588.gal, -t, CGAL, -LTL, /tmp/LTL2076647639284268752.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/LTL13662898353084276588.gal -t CGAL -LTL /tmp/LTL2076647639284268752.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p407==0)||(p299==1))"))))
Formula 0 simplified : !XF"((p407==0)||(p299==1))"
Detected timeout of ITS tools.
[2021-05-08 10:43:06] [INFO ] Flatten gal took : 12 ms
[2021-05-08 10:43:06] [INFO ] Applying decomposition
[2021-05-08 10:43:06] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12410577240811461807.txt, -o, /tmp/graph12410577240811461807.bin, -w, /tmp/graph12410577240811461807.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12410577240811461807.bin, -l, -1, -v, -w, /tmp/graph12410577240811461807.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:43:06] [INFO ] Decomposing Gal with order
[2021-05-08 10:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:43:06] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-08 10:43:06] [INFO ] Flatten gal took : 54 ms
[2021-05-08 10:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-08 10:43:06] [INFO ] Time to serialize gal into /tmp/LTL13488730180654517893.gal : 10 ms
[2021-05-08 10:43:06] [INFO ] Time to serialize properties into /tmp/LTL11132670921551690881.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/LTL13488730180654517893.gal, -t, CGAL, -LTL, /tmp/LTL11132670921551690881.ltl, -c, -stutter-deadlock], 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/LTL13488730180654517893.gal -t CGAL -LTL /tmp/LTL11132670921551690881.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i9.u122.p407==0)||(i15.u82.p299==1))"))))
Formula 0 simplified : !XF"((i9.u122.p407==0)||(i15.u82.p299==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11251326648153452930
[2021-05-08 10:43:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11251326648153452930
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11251326648153452930]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11251326648153452930] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11251326648153452930] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property AutoFlight-PT-06b-11 finished in 36608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 453 transition count 439
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 453 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 450 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 449 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 449 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 448 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 448 transition count 434
Applied a total of 26 rules in 59 ms. Remains 448 /461 variables (removed 13) and now considering 434/447 (removed 13) transitions.
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:43:22] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:43:22] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:43:22] [INFO ] Computed 40 place invariants in 1 ms
[2021-05-08 10:43:23] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
// Phase 1: matrix 434 rows 448 cols
[2021-05-08 10:43:23] [INFO ] Computed 40 place invariants in 2 ms
[2021-05-08 10:43:23] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/461 places, 434/447 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s343 0) (EQ s188 1)), p1:(NEQ s245 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-13 finished in 773 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 461/461 places, 447/447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 460 transition count 291
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 173 rules applied. Total rules applied 328 place count 305 transition count 273
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 293 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 342 place count 292 transition count 272
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 342 place count 292 transition count 215
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 456 place count 235 transition count 215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 463 place count 228 transition count 208
Iterating global reduction 4 with 7 rules applied. Total rules applied 470 place count 228 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 470 place count 228 transition count 204
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 478 place count 224 transition count 204
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 654 place count 136 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 655 place count 135 transition count 103
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 669 place count 125 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 673 place count 121 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 673 place count 121 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 685 place count 115 transition count 93
Applied a total of 685 rules in 26 ms. Remains 115 /461 variables (removed 346) and now considering 93/447 (removed 354) transitions.
// Phase 1: matrix 93 rows 115 cols
[2021-05-08 10:43:23] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-08 10:43:23] [INFO ] Implicit Places using invariants in 63 ms returned [47, 67, 87, 91, 95, 99, 103, 108, 114]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 ms to find 9 implicit places.
[2021-05-08 10:43:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 93 rows 106 cols
[2021-05-08 10:43:23] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-08 10:43:23] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 106/461 places, 93/447 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 99 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 99 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 98 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 98 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 96 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 96 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 95 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 95 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 92 transition count 79
Applied a total of 28 rules in 12 ms. Remains 92 /106 variables (removed 14) and now considering 79/93 (removed 14) transitions.
// Phase 1: matrix 79 rows 92 cols
[2021-05-08 10:43:23] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-08 10:43:23] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 79 rows 92 cols
[2021-05-08 10:43:23] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-08 10:43:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 10:43:23] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 92/461 places, 79/447 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-14 finished in 346 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6020053496961380691
[2021-05-08 10:43:23] [INFO ] Computing symmetric may disable matrix : 447 transitions.
[2021-05-08 10:43:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:43:23] [INFO ] Computing symmetric may enable matrix : 447 transitions.
[2021-05-08 10:43:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:43:23] [INFO ] Applying decomposition
[2021-05-08 10:43:23] [INFO ] Computing Do-Not-Accords matrix : 447 transitions.
[2021-05-08 10:43:23] [INFO ] Flatten gal took : 34 ms
[2021-05-08 10:43:23] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 10:43:23] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6020053496961380691
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6020053496961380691]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3270110896632152833.txt, -o, /tmp/graph3270110896632152833.bin, -w, /tmp/graph3270110896632152833.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3270110896632152833.bin, -l, -1, -v, -w, /tmp/graph3270110896632152833.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:43:23] [INFO ] Decomposing Gal with order
[2021-05-08 10:43:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:43:23] [INFO ] Removed a total of 78 redundant transitions.
[2021-05-08 10:43:23] [INFO ] Flatten gal took : 26 ms
[2021-05-08 10:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 10:43:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality9856278695003951473.gal : 3 ms
[2021-05-08 10:43:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality4366651449522622817.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/LTLCardinality9856278695003951473.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4366651449522622817.ltl, -c, -stutter-deadlock], 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/LTLCardinality9856278695003951473.gal -t CGAL -LTL /tmp/LTLCardinality4366651449522622817.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((G("((i7.u42.p134==0)||(i13.u70.p228==1))"))||(X(F("(i2.u37.p110!=1)")))))
Formula 0 simplified : !(G"((i7.u42.p134==0)||(i13.u70.p228==1))" | XF"(i2.u37.p110!=1)")
Compilation finished in 2508 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6020053496961380691]
Link finished in 81 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6020053496961380691]
LTSmin run took 429 ms.
FORMULA AutoFlight-PT-06b-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6020053496961380691]
LTSmin run took 706 ms.
FORMULA AutoFlight-PT-06b-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620470608749

--------------------
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-06b"
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-06b, 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-162037990000457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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