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-162037990100489.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-24b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990100489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:21 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 538K 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-24b-00
FORMULA_NAME AutoFlight-PT-24b-01
FORMULA_NAME AutoFlight-PT-24b-02
FORMULA_NAME AutoFlight-PT-24b-03
FORMULA_NAME AutoFlight-PT-24b-04
FORMULA_NAME AutoFlight-PT-24b-05
FORMULA_NAME AutoFlight-PT-24b-06
FORMULA_NAME AutoFlight-PT-24b-07
FORMULA_NAME AutoFlight-PT-24b-08
FORMULA_NAME AutoFlight-PT-24b-09
FORMULA_NAME AutoFlight-PT-24b-10
FORMULA_NAME AutoFlight-PT-24b-11
FORMULA_NAME AutoFlight-PT-24b-12
FORMULA_NAME AutoFlight-PT-24b-13
FORMULA_NAME AutoFlight-PT-24b-14
FORMULA_NAME AutoFlight-PT-24b-15

=== Now, execution of the tool begins

BK_START 1620475039184

Running Version 0
[2021-05-08 11:57:20] [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 11:57:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:57:20] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2021-05-08 11:57:20] [INFO ] Transformed 2230 places.
[2021-05-08 11:57:21] [INFO ] Transformed 2228 transitions.
[2021-05-08 11:57:21] [INFO ] Found NUPN structural information;
[2021-05-08 11:57:21] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 11:57:21] [INFO ] Initial state test concluded for 3 properties.
FORMULA AutoFlight-PT-24b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 307 place count 1923 transition count 1921
Iterating global reduction 0 with 307 rules applied. Total rules applied 614 place count 1923 transition count 1921
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 661 place count 1923 transition count 1874
Discarding 136 places :
Symmetric choice reduction at 1 with 136 rule applications. Total rules 797 place count 1787 transition count 1738
Iterating global reduction 1 with 136 rules applied. Total rules applied 933 place count 1787 transition count 1738
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 957 place count 1763 transition count 1714
Iterating global reduction 1 with 24 rules applied. Total rules applied 981 place count 1763 transition count 1714
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 1003 place count 1741 transition count 1692
Iterating global reduction 1 with 22 rules applied. Total rules applied 1025 place count 1741 transition count 1692
Applied a total of 1025 rules in 1756 ms. Remains 1741 /2230 variables (removed 489) and now considering 1692/2228 (removed 536) transitions.
// Phase 1: matrix 1692 rows 1741 cols
[2021-05-08 11:57:23] [INFO ] Computed 148 place invariants in 52 ms
[2021-05-08 11:57:23] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 1692 rows 1741 cols
[2021-05-08 11:57:23] [INFO ] Computed 148 place invariants in 12 ms
[2021-05-08 11:57:25] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
// Phase 1: matrix 1692 rows 1741 cols
[2021-05-08 11:57:25] [INFO ] Computed 148 place invariants in 11 ms
[2021-05-08 11:57:26] [INFO ] Dead Transitions using invariants and state equation in 868 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1741/2230 places, 1692/2228 transitions.
[2021-05-08 11:57:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 11:57:26] [INFO ] Flatten gal took : 131 ms
FORMULA AutoFlight-PT-24b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 11:57:26] [INFO ] Flatten gal took : 78 ms
[2021-05-08 11:57:27] [INFO ] Input system was already deterministic with 1692 transitions.
Incomplete random walk after 100000 steps, including 93 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 18) seen :11
Running SMT prover for 7 properties.
// Phase 1: matrix 1692 rows 1741 cols
[2021-05-08 11:57:27] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 11:57:27] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2021-05-08 11:57:27] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:57:28] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-08 11:57:29] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 5 ms to minimize.
[2021-05-08 11:57:29] [INFO ] Deduced a trap composed of 45 places in 455 ms of which 1 ms to minimize.
[2021-05-08 11:57:30] [INFO ] Deduced a trap composed of 123 places in 424 ms of which 2 ms to minimize.
[2021-05-08 11:57:30] [INFO ] Deduced a trap composed of 127 places in 413 ms of which 2 ms to minimize.
[2021-05-08 11:57:30] [INFO ] Deduced a trap composed of 119 places in 396 ms of which 2 ms to minimize.
[2021-05-08 11:57:31] [INFO ] Deduced a trap composed of 114 places in 267 ms of which 1 ms to minimize.
[2021-05-08 11:57:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2896 ms
[2021-05-08 11:57:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:57:31] [INFO ] [Nat]Absence check using 147 positive place invariants in 75 ms returned sat
[2021-05-08 11:57:31] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:57:32] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2021-05-08 11:57:32] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 2 ms to minimize.
[2021-05-08 11:57:33] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 2 ms to minimize.
[2021-05-08 11:57:33] [INFO ] Deduced a trap composed of 123 places in 444 ms of which 1 ms to minimize.
[2021-05-08 11:57:34] [INFO ] Deduced a trap composed of 127 places in 376 ms of which 1 ms to minimize.
[2021-05-08 11:57:34] [INFO ] Deduced a trap composed of 119 places in 395 ms of which 1 ms to minimize.
[2021-05-08 11:57:35] [INFO ] Deduced a trap composed of 277 places in 415 ms of which 1 ms to minimize.
[2021-05-08 11:57:35] [INFO ] Deduced a trap composed of 262 places in 411 ms of which 1 ms to minimize.
[2021-05-08 11:57:36] [INFO ] Deduced a trap composed of 137 places in 377 ms of which 1 ms to minimize.
[2021-05-08 11:57:36] [INFO ] Deduced a trap composed of 59 places in 426 ms of which 1 ms to minimize.
[2021-05-08 11:57:37] [INFO ] Deduced a trap composed of 180 places in 419 ms of which 1 ms to minimize.
[2021-05-08 11:57:37] [INFO ] Deduced a trap composed of 225 places in 386 ms of which 1 ms to minimize.
[2021-05-08 11:57:37] [INFO ] Deduced a trap composed of 292 places in 424 ms of which 1 ms to minimize.
[2021-05-08 11:57:38] [INFO ] Deduced a trap composed of 258 places in 393 ms of which 1 ms to minimize.
[2021-05-08 11:57:38] [INFO ] Deduced a trap composed of 273 places in 378 ms of which 1 ms to minimize.
[2021-05-08 11:57:39] [INFO ] Deduced a trap composed of 267 places in 429 ms of which 1 ms to minimize.
[2021-05-08 11:57:39] [INFO ] Deduced a trap composed of 136 places in 384 ms of which 1 ms to minimize.
[2021-05-08 11:57:40] [INFO ] Deduced a trap composed of 143 places in 392 ms of which 1 ms to minimize.
[2021-05-08 11:57:40] [INFO ] Deduced a trap composed of 215 places in 404 ms of which 1 ms to minimize.
[2021-05-08 11:57:41] [INFO ] Deduced a trap composed of 281 places in 404 ms of which 1 ms to minimize.
[2021-05-08 11:57:41] [INFO ] Deduced a trap composed of 265 places in 412 ms of which 2 ms to minimize.
[2021-05-08 11:57:42] [INFO ] Deduced a trap composed of 257 places in 410 ms of which 1 ms to minimize.
[2021-05-08 11:57:42] [INFO ] Deduced a trap composed of 281 places in 397 ms of which 1 ms to minimize.
[2021-05-08 11:57:42] [INFO ] Deduced a trap composed of 254 places in 359 ms of which 1 ms to minimize.
[2021-05-08 11:57:43] [INFO ] Deduced a trap composed of 278 places in 365 ms of which 1 ms to minimize.
[2021-05-08 11:57:43] [INFO ] Deduced a trap composed of 252 places in 385 ms of which 1 ms to minimize.
[2021-05-08 11:57:44] [INFO ] Deduced a trap composed of 285 places in 363 ms of which 1 ms to minimize.
[2021-05-08 11:57:44] [INFO ] Deduced a trap composed of 166 places in 373 ms of which 1 ms to minimize.
[2021-05-08 11:57:45] [INFO ] Deduced a trap composed of 232 places in 402 ms of which 5 ms to minimize.
[2021-05-08 11:57:45] [INFO ] Deduced a trap composed of 302 places in 393 ms of which 1 ms to minimize.
[2021-05-08 11:57:45] [INFO ] Deduced a trap composed of 281 places in 390 ms of which 1 ms to minimize.
[2021-05-08 11:57:46] [INFO ] Deduced a trap composed of 281 places in 382 ms of which 1 ms to minimize.
[2021-05-08 11:57:46] [INFO ] Deduced a trap composed of 281 places in 380 ms of which 0 ms to minimize.
[2021-05-08 11:57:47] [INFO ] Deduced a trap composed of 281 places in 378 ms of which 0 ms to minimize.
[2021-05-08 11:57:47] [INFO ] Deduced a trap composed of 281 places in 367 ms of which 1 ms to minimize.
[2021-05-08 11:57:47] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15541 ms
[2021-05-08 11:57:47] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 87 ms.
[2021-05-08 11:57:52] [INFO ] Deduced a trap composed of 10 places in 784 ms of which 12 ms to minimize.
[2021-05-08 11:57:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-08 11:57:52] [INFO ] [Real]Absence check using 147 positive place invariants in 73 ms returned sat
[2021-05-08 11:57:52] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:57:53] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2021-05-08 11:57:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:57:53] [INFO ] [Nat]Absence check using 147 positive place invariants in 73 ms returned sat
[2021-05-08 11:57:53] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:57:54] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2021-05-08 11:57:54] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2021-05-08 11:57:54] [INFO ] Deduced a trap composed of 251 places in 392 ms of which 1 ms to minimize.
[2021-05-08 11:57:55] [INFO ] Deduced a trap composed of 137 places in 374 ms of which 1 ms to minimize.
[2021-05-08 11:57:55] [INFO ] Deduced a trap composed of 164 places in 403 ms of which 1 ms to minimize.
[2021-05-08 11:57:56] [INFO ] Deduced a trap composed of 160 places in 405 ms of which 1 ms to minimize.
[2021-05-08 11:57:56] [INFO ] Deduced a trap composed of 167 places in 413 ms of which 1 ms to minimize.
[2021-05-08 11:57:57] [INFO ] Deduced a trap composed of 164 places in 402 ms of which 1 ms to minimize.
[2021-05-08 11:57:57] [INFO ] Deduced a trap composed of 259 places in 411 ms of which 1 ms to minimize.
[2021-05-08 11:57:58] [INFO ] Deduced a trap composed of 266 places in 396 ms of which 1 ms to minimize.
[2021-05-08 11:57:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4167 ms
[2021-05-08 11:57:58] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 99 ms.
[2021-05-08 11:58:13] [INFO ] Added : 850 causal constraints over 170 iterations in 14957 ms. Result :unknown
[2021-05-08 11:58:13] [INFO ] [Real]Absence check using 147 positive place invariants in 79 ms returned sat
[2021-05-08 11:58:13] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:58:14] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2021-05-08 11:58:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:58:14] [INFO ] [Nat]Absence check using 147 positive place invariants in 69 ms returned sat
[2021-05-08 11:58:14] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:58:15] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2021-05-08 11:58:15] [INFO ] Deduced a trap composed of 55 places in 431 ms of which 2 ms to minimize.
[2021-05-08 11:58:15] [INFO ] Deduced a trap composed of 261 places in 426 ms of which 1 ms to minimize.
[2021-05-08 11:58:16] [INFO ] Deduced a trap composed of 135 places in 427 ms of which 1 ms to minimize.
[2021-05-08 11:58:16] [INFO ] Deduced a trap composed of 180 places in 442 ms of which 1 ms to minimize.
[2021-05-08 11:58:17] [INFO ] Deduced a trap composed of 216 places in 410 ms of which 1 ms to minimize.
[2021-05-08 11:58:17] [INFO ] Deduced a trap composed of 216 places in 406 ms of which 5 ms to minimize.
[2021-05-08 11:58:18] [INFO ] Deduced a trap composed of 164 places in 421 ms of which 1 ms to minimize.
[2021-05-08 11:58:18] [INFO ] Deduced a trap composed of 165 places in 410 ms of which 1 ms to minimize.
[2021-05-08 11:58:19] [INFO ] Deduced a trap composed of 216 places in 418 ms of which 1 ms to minimize.
[2021-05-08 11:58:19] [INFO ] Deduced a trap composed of 234 places in 390 ms of which 1 ms to minimize.
[2021-05-08 11:58:20] [INFO ] Deduced a trap composed of 262 places in 383 ms of which 1 ms to minimize.
[2021-05-08 11:58:20] [INFO ] Deduced a trap composed of 214 places in 360 ms of which 1 ms to minimize.
[2021-05-08 11:58:21] [INFO ] Deduced a trap composed of 264 places in 386 ms of which 1 ms to minimize.
[2021-05-08 11:58:21] [INFO ] Deduced a trap composed of 216 places in 362 ms of which 1 ms to minimize.
[2021-05-08 11:58:21] [INFO ] Deduced a trap composed of 300 places in 346 ms of which 1 ms to minimize.
[2021-05-08 11:58:22] [INFO ] Deduced a trap composed of 285 places in 362 ms of which 3 ms to minimize.
[2021-05-08 11:58:22] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7324 ms
[2021-05-08 11:58:22] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 103 ms.
[2021-05-08 11:58:34] [INFO ] Deduced a trap composed of 10 places in 756 ms of which 1 ms to minimize.
[2021-05-08 11:58:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-08 11:58:35] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2021-05-08 11:58:35] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:58:35] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2021-05-08 11:58:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:58:35] [INFO ] [Nat]Absence check using 147 positive place invariants in 73 ms returned unsat
[2021-05-08 11:58:36] [INFO ] [Real]Absence check using 147 positive place invariants in 67 ms returned sat
[2021-05-08 11:58:36] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-08 11:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:58:36] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2021-05-08 11:58:37] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 7 ms to minimize.
[2021-05-08 11:58:37] [INFO ] Deduced a trap composed of 285 places in 431 ms of which 1 ms to minimize.
[2021-05-08 11:58:38] [INFO ] Deduced a trap composed of 263 places in 390 ms of which 1 ms to minimize.
[2021-05-08 11:58:38] [INFO ] Deduced a trap composed of 290 places in 416 ms of which 1 ms to minimize.
[2021-05-08 11:58:39] [INFO ] Deduced a trap composed of 214 places in 394 ms of which 1 ms to minimize.
[2021-05-08 11:58:39] [INFO ] Deduced a trap composed of 281 places in 376 ms of which 1 ms to minimize.
[2021-05-08 11:58:40] [INFO ] Deduced a trap composed of 285 places in 390 ms of which 1 ms to minimize.
[2021-05-08 11:58:40] [INFO ] Deduced a trap composed of 301 places in 361 ms of which 1 ms to minimize.
[2021-05-08 11:58:40] [INFO ] Deduced a trap composed of 261 places in 358 ms of which 1 ms to minimize.
[2021-05-08 11:58:41] [INFO ] Deduced a trap composed of 281 places in 360 ms of which 1 ms to minimize.
[2021-05-08 11:58:41] [INFO ] Deduced a trap composed of 285 places in 364 ms of which 1 ms to minimize.
[2021-05-08 11:58:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4979 ms
[2021-05-08 11:58:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:58:42] [INFO ] [Nat]Absence check using 147 positive place invariants in 67 ms returned sat
[2021-05-08 11:58:42] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:58:42] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-08 11:58:43] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 1 ms to minimize.
[2021-05-08 11:58:43] [INFO ] Deduced a trap composed of 285 places in 417 ms of which 1 ms to minimize.
[2021-05-08 11:58:44] [INFO ] Deduced a trap composed of 263 places in 404 ms of which 1 ms to minimize.
[2021-05-08 11:58:44] [INFO ] Deduced a trap composed of 290 places in 429 ms of which 1 ms to minimize.
[2021-05-08 11:58:44] [INFO ] Deduced a trap composed of 214 places in 402 ms of which 1 ms to minimize.
[2021-05-08 11:58:45] [INFO ] Deduced a trap composed of 281 places in 393 ms of which 1 ms to minimize.
[2021-05-08 11:58:45] [INFO ] Deduced a trap composed of 285 places in 396 ms of which 1 ms to minimize.
[2021-05-08 11:58:46] [INFO ] Deduced a trap composed of 301 places in 358 ms of which 1 ms to minimize.
[2021-05-08 11:58:46] [INFO ] Deduced a trap composed of 261 places in 385 ms of which 0 ms to minimize.
[2021-05-08 11:58:47] [INFO ] Deduced a trap composed of 281 places in 365 ms of which 1 ms to minimize.
[2021-05-08 11:58:47] [INFO ] Deduced a trap composed of 285 places in 366 ms of which 1 ms to minimize.
[2021-05-08 11:58:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4984 ms
[2021-05-08 11:58:47] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 76 ms.
[2021-05-08 11:59:02] [INFO ] Deduced a trap composed of 10 places in 718 ms of which 4 ms to minimize.
[2021-05-08 11:59:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-08 11:59:02] [INFO ] [Real]Absence check using 147 positive place invariants in 66 ms returned sat
[2021-05-08 11:59:02] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:59:03] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2021-05-08 11:59:03] [INFO ] Deduced a trap composed of 139 places in 417 ms of which 1 ms to minimize.
[2021-05-08 11:59:04] [INFO ] Deduced a trap composed of 230 places in 430 ms of which 1 ms to minimize.
[2021-05-08 11:59:04] [INFO ] Deduced a trap composed of 214 places in 442 ms of which 1 ms to minimize.
[2021-05-08 11:59:05] [INFO ] Deduced a trap composed of 281 places in 407 ms of which 1 ms to minimize.
[2021-05-08 11:59:05] [INFO ] Deduced a trap composed of 128 places in 435 ms of which 1 ms to minimize.
[2021-05-08 11:59:06] [INFO ] Deduced a trap composed of 286 places in 410 ms of which 1 ms to minimize.
[2021-05-08 11:59:06] [INFO ] Deduced a trap composed of 233 places in 376 ms of which 1 ms to minimize.
[2021-05-08 11:59:07] [INFO ] Deduced a trap composed of 281 places in 384 ms of which 1 ms to minimize.
[2021-05-08 11:59:07] [INFO ] Deduced a trap composed of 214 places in 412 ms of which 1 ms to minimize.
[2021-05-08 11:59:08] [INFO ] Deduced a trap composed of 214 places in 383 ms of which 1 ms to minimize.
[2021-05-08 11:59:08] [INFO ] Deduced a trap composed of 214 places in 408 ms of which 1 ms to minimize.
[2021-05-08 11:59:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5188 ms
[2021-05-08 11:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:59:08] [INFO ] [Nat]Absence check using 147 positive place invariants in 69 ms returned sat
[2021-05-08 11:59:08] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:59:09] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2021-05-08 11:59:09] [INFO ] Deduced a trap composed of 139 places in 407 ms of which 1 ms to minimize.
[2021-05-08 11:59:10] [INFO ] Deduced a trap composed of 230 places in 414 ms of which 1 ms to minimize.
[2021-05-08 11:59:10] [INFO ] Deduced a trap composed of 214 places in 437 ms of which 1 ms to minimize.
[2021-05-08 11:59:11] [INFO ] Deduced a trap composed of 281 places in 425 ms of which 1 ms to minimize.
[2021-05-08 11:59:11] [INFO ] Deduced a trap composed of 128 places in 406 ms of which 1 ms to minimize.
[2021-05-08 11:59:12] [INFO ] Deduced a trap composed of 286 places in 418 ms of which 1 ms to minimize.
[2021-05-08 11:59:12] [INFO ] Deduced a trap composed of 233 places in 387 ms of which 1 ms to minimize.
[2021-05-08 11:59:13] [INFO ] Deduced a trap composed of 281 places in 386 ms of which 1 ms to minimize.
[2021-05-08 11:59:13] [INFO ] Deduced a trap composed of 214 places in 427 ms of which 1 ms to minimize.
[2021-05-08 11:59:14] [INFO ] Deduced a trap composed of 214 places in 426 ms of which 1 ms to minimize.
[2021-05-08 11:59:14] [INFO ] Deduced a trap composed of 214 places in 414 ms of which 1 ms to minimize.
[2021-05-08 11:59:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5218 ms
[2021-05-08 11:59:14] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 84 ms.
[2021-05-08 11:59:29] [INFO ] Deduced a trap composed of 10 places in 806 ms of which 1 ms to minimize.
[2021-05-08 11:59:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-08 11:59:29] [INFO ] [Real]Absence check using 147 positive place invariants in 70 ms returned sat
[2021-05-08 11:59:29] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 11:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:59:30] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2021-05-08 11:59:30] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 1 ms to minimize.
[2021-05-08 11:59:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2021-05-08 11:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:59:31] [INFO ] [Nat]Absence check using 147 positive place invariants in 71 ms returned sat
[2021-05-08 11:59:31] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 11:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:59:31] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2021-05-08 11:59:32] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2021-05-08 11:59:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2021-05-08 11:59:32] [INFO ] Computed and/alt/rep : 1689/2346/1689 causal constraints (skipped 2 transitions) in 97 ms.
[2021-05-08 11:59:51] [INFO ] Deduced a trap composed of 10 places in 749 ms of which 18 ms to minimize.
[2021-05-08 11:59:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-08 11:59:51] [INFO ] Initial state test concluded for 1 properties.
FORMULA AutoFlight-PT-24b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1740 transition count 1061
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 700 rules applied. Total rules applied 1330 place count 1110 transition count 991
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 1376 place count 1064 transition count 991
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1376 place count 1064 transition count 790
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1778 place count 863 transition count 790
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1784 place count 857 transition count 784
Iterating global reduction 3 with 6 rules applied. Total rules applied 1790 place count 857 transition count 784
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1790 place count 857 transition count 782
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1794 place count 855 transition count 782
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2470 place count 517 transition count 396
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2472 place count 516 transition count 396
Applied a total of 2472 rules in 370 ms. Remains 516 /1741 variables (removed 1225) and now considering 396/1692 (removed 1296) transitions.
// Phase 1: matrix 396 rows 516 cols
[2021-05-08 11:59:58] [INFO ] Computed 148 place invariants in 1 ms
[2021-05-08 11:59:58] [INFO ] Implicit Places using invariants in 457 ms returned [171, 172, 176, 177, 178, 179, 180, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 296, 370, 376, 382, 388, 394, 400, 406, 412, 418, 424, 430, 436, 442, 448, 454, 460, 466, 472, 478, 484, 490, 496, 502, 508, 515]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 459 ms to find 73 implicit places.
[2021-05-08 11:59:58] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 396 rows 443 cols
[2021-05-08 11:59:58] [INFO ] Computed 75 place invariants in 2 ms
[2021-05-08 11:59:58] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Starting structural reductions, iteration 1 : 443/1741 places, 396/1692 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 443 transition count 350
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 397 transition count 350
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 117 place count 372 transition count 325
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 372 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 371 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 371 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 370 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 370 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 369 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 369 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 368 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 367 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 366 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 365 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 365 transition count 318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 364 transition count 317
Applied a total of 158 rules in 119 ms. Remains 364 /443 variables (removed 79) and now considering 317/396 (removed 79) transitions.
// Phase 1: matrix 317 rows 364 cols
[2021-05-08 11:59:59] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 11:59:59] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 317 rows 364 cols
[2021-05-08 11:59:59] [INFO ] Computed 75 place invariants in 2 ms
[2021-05-08 11:59:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2021-05-08 11:59:59] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 364/1741 places, 317/1692 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s57 0) (EQ s172 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 77 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-24b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-01 finished in 8424 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p0)) U G(p1))&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1732 transition count 1683
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1732 transition count 1683
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 1728 transition count 1679
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 1728 transition count 1679
Applied a total of 26 rules in 235 ms. Remains 1728 /1741 variables (removed 13) and now considering 1679/1692 (removed 13) transitions.
// Phase 1: matrix 1679 rows 1728 cols
[2021-05-08 12:00:00] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:00:00] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 1679 rows 1728 cols
[2021-05-08 12:00:00] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:00:02] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
// Phase 1: matrix 1679 rows 1728 cols
[2021-05-08 12:00:02] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:00:08] [INFO ] Dead Transitions using invariants and state equation in 6005 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1728/1741 places, 1679/1692 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-24b-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1314 0) (EQ s285 1)), p0:(OR (EQ s285 0) (EQ s1314 1)), p2:(NEQ s625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37300 reset in 1101 ms.
Product exploration explored 100000 steps with 37675 reset in 1026 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 37477 reset in 942 ms.
Product exploration explored 100000 steps with 37659 reset in 949 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) p0)]
Support contains 3 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1728/1728 places, 1679/1679 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1728 transition count 1679
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 602 place count 1728 transition count 1655
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 602 place count 1728 transition count 1775
Deduced a syphon composed of 799 places in 6 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 823 place count 1728 transition count 1775
Discarding 453 places :
Symmetric choice reduction at 2 with 453 rule applications. Total rules 1276 place count 1275 transition count 1322
Deduced a syphon composed of 346 places in 4 ms
Iterating global reduction 2 with 453 rules applied. Total rules applied 1729 place count 1275 transition count 1322
Performed 415 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 761 places in 1 ms
Iterating global reduction 2 with 415 rules applied. Total rules applied 2144 place count 1275 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Discarding 269 places :
Symmetric choice reduction at 2 with 269 rule applications. Total rules 2413 place count 1006 transition count 1005
Deduced a syphon composed of 492 places in 0 ms
Iterating global reduction 2 with 269 rules applied. Total rules applied 2682 place count 1006 transition count 1005
Deduced a syphon composed of 492 places in 0 ms
Applied a total of 2682 rules in 781 ms. Remains 1006 /1728 variables (removed 722) and now considering 1005/1679 (removed 674) transitions.
[2021-05-08 12:00:14] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1005 rows 1006 cols
[2021-05-08 12:00:14] [INFO ] Computed 148 place invariants in 26 ms
[2021-05-08 12:00:14] [INFO ] Dead Transitions using invariants and state equation in 561 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1006/1728 places, 1005/1679 transitions.
Entered a terminal (fully accepting) state of product in 782 steps with 293 reset in 68 ms.
FORMULA AutoFlight-PT-24b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-04 finished in 14825 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 632 place count 1740 transition count 1059
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 705 rules applied. Total rules applied 1337 place count 1108 transition count 986
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1385 place count 1060 transition count 986
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1385 place count 1060 transition count 787
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1783 place count 861 transition count 787
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1788 place count 856 transition count 782
Iterating global reduction 3 with 5 rules applied. Total rules applied 1793 place count 856 transition count 782
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1793 place count 856 transition count 780
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1797 place count 854 transition count 780
Performed 335 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 2467 place count 519 transition count 398
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2468 place count 519 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2469 place count 518 transition count 397
Iterating global reduction 3 with 1 rules applied. Total rules applied 2470 place count 518 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2471 place count 518 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2472 place count 517 transition count 395
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 66 rules applied. Total rules applied 2538 place count 472 transition count 374
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 2559 place count 451 transition count 374
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2559 place count 451 transition count 350
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2607 place count 427 transition count 350
Applied a total of 2607 rules in 177 ms. Remains 427 /1741 variables (removed 1314) and now considering 350/1692 (removed 1342) transitions.
// Phase 1: matrix 350 rows 427 cols
[2021-05-08 12:00:19] [INFO ] Computed 103 place invariants in 3 ms
[2021-05-08 12:00:19] [INFO ] Implicit Places using invariants in 227 ms returned [178, 252, 326, 330, 334, 338, 343, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 393, 397, 401, 405, 409, 413, 417, 421, 426]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 229 ms to find 27 implicit places.
[2021-05-08 12:00:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 350 rows 400 cols
[2021-05-08 12:00:19] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:00:19] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Starting structural reductions, iteration 1 : 400/1741 places, 350/1692 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 375 transition count 325
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 375 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 374 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 374 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 373 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 373 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 372 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 360 transition count 310
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 82 place count 359 transition count 309
Applied a total of 82 rules in 104 ms. Remains 359 /400 variables (removed 41) and now considering 309/350 (removed 41) transitions.
// Phase 1: matrix 309 rows 359 cols
[2021-05-08 12:00:19] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:00:19] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 309 rows 359 cols
[2021-05-08 12:00:19] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:00:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 12:00:20] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 359/1741 places, 309/1692 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s172 0) (EQ s177 1)), p0:(AND (NEQ s114 0) (NEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9967 steps with 120 reset in 133 ms.
FORMULA AutoFlight-PT-24b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-05 finished in 5625 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1740 transition count 1060
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 704 rules applied. Total rules applied 1335 place count 1109 transition count 987
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1383 place count 1061 transition count 987
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1383 place count 1061 transition count 787
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1783 place count 861 transition count 787
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1790 place count 854 transition count 780
Iterating global reduction 3 with 7 rules applied. Total rules applied 1797 place count 854 transition count 780
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1797 place count 854 transition count 777
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1803 place count 851 transition count 777
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 2475 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2476 place count 514 transition count 392
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 70 rules applied. Total rules applied 2546 place count 467 transition count 369
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 2569 place count 444 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2569 place count 444 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2617 place count 420 transition count 345
Applied a total of 2617 rules in 144 ms. Remains 420 /1741 variables (removed 1321) and now considering 345/1692 (removed 1347) transitions.
// Phase 1: matrix 345 rows 420 cols
[2021-05-08 12:00:20] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-08 12:00:20] [INFO ] Implicit Places using invariants in 222 ms returned [170, 319, 323, 327, 331, 335, 340, 344, 348, 352, 356, 360, 364, 368, 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 223 ms to find 25 implicit places.
[2021-05-08 12:00:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 345 rows 395 cols
[2021-05-08 12:00:20] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 12:00:21] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Starting structural reductions, iteration 1 : 395/1741 places, 345/1692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 372 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 372 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 369 transition count 319
Applied a total of 52 rules in 27 ms. Remains 369 /395 variables (removed 26) and now considering 319/345 (removed 26) transitions.
// Phase 1: matrix 319 rows 369 cols
[2021-05-08 12:00:21] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:00:21] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 319 rows 369 cols
[2021-05-08 12:00:21] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 12:00:21] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 369/1741 places, 319/1692 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s347 0) (EQ s315 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 146 steps with 1 reset in 2 ms.
FORMULA AutoFlight-PT-24b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-08 finished in 1185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1731 transition count 1682
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1731 transition count 1682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1731 transition count 1681
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 1727 transition count 1677
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1726 transition count 1676
Applied a total of 31 rules in 406 ms. Remains 1726 /1741 variables (removed 15) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:00:22] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-08 12:00:22] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:00:22] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:00:24] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:00:24] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:00:25] [INFO ] Dead Transitions using invariants and state equation in 956 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1726/1741 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 517 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1082 1), p1:(OR (EQ s664 0) (EQ s601 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 33333 reset in 861 ms.
Product exploration explored 100000 steps with 33333 reset in 893 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 862 ms.
Product exploration explored 100000 steps with 33333 reset in 880 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1726 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1726/1726 places, 1676/1676 transitions.
Performed 552 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 1726 transition count 1676
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 600 place count 1726 transition count 1652
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 600 place count 1726 transition count 1775
Deduced a syphon composed of 798 places in 5 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 822 place count 1726 transition count 1775
Discarding 451 places :
Symmetric choice reduction at 2 with 451 rule applications. Total rules 1273 place count 1275 transition count 1324
Deduced a syphon composed of 347 places in 4 ms
Iterating global reduction 2 with 451 rules applied. Total rules applied 1724 place count 1275 transition count 1324
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 759 places in 1 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2136 place count 1275 transition count 1276
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 2 with 266 rule applications. Total rules 2402 place count 1009 transition count 1010
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 2 with 266 rules applied. Total rules applied 2668 place count 1009 transition count 1010
Deduced a syphon composed of 493 places in 1 ms
Applied a total of 2668 rules in 553 ms. Remains 1009 /1726 variables (removed 717) and now considering 1010/1676 (removed 666) transitions.
[2021-05-08 12:00:30] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1010 rows 1009 cols
[2021-05-08 12:00:30] [INFO ] Computed 148 place invariants in 24 ms
[2021-05-08 12:00:30] [INFO ] Dead Transitions using invariants and state equation in 567 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1009/1726 places, 1010/1676 transitions.
Product exploration explored 100000 steps with 33333 reset in 2733 ms.
Product exploration explored 100000 steps with 33333 reset in 2705 ms.
[2021-05-08 12:00:36] [INFO ] Flatten gal took : 124 ms
[2021-05-08 12:00:36] [INFO ] Flatten gal took : 98 ms
[2021-05-08 12:00:36] [INFO ] Time to serialize gal into /tmp/LTL12696995989871303936.gal : 68 ms
[2021-05-08 12:00:36] [INFO ] Time to serialize properties into /tmp/LTL8169891499798258019.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/LTL12696995989871303936.gal, -t, CGAL, -LTL, /tmp/LTL8169891499798258019.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/LTL12696995989871303936.gal -t CGAL -LTL /tmp/LTL8169891499798258019.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p1560==1)"))||(X(X(F("((p1037==0)||(p930==1))"))))))
Formula 0 simplified : !(F"(p1560==1)" | XXF"((p1037==0)||(p930==1))")
Detected timeout of ITS tools.
[2021-05-08 12:00:51] [INFO ] Flatten gal took : 51 ms
[2021-05-08 12:00:51] [INFO ] Applying decomposition
[2021-05-08 12:00:51] [INFO ] Flatten gal took : 46 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/graph8193201711417339790.txt, -o, /tmp/graph8193201711417339790.bin, -w, /tmp/graph8193201711417339790.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/graph8193201711417339790.bin, -l, -1, -v, -w, /tmp/graph8193201711417339790.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:00:52] [INFO ] Decomposing Gal with order
[2021-05-08 12:00:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:00:52] [INFO ] Removed a total of 328 redundant transitions.
[2021-05-08 12:00:52] [INFO ] Flatten gal took : 156 ms
[2021-05-08 12:00:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-08 12:00:52] [INFO ] Time to serialize gal into /tmp/LTL17449537092424685217.gal : 17 ms
[2021-05-08 12:00:52] [INFO ] Time to serialize properties into /tmp/LTL6225716169690027125.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/LTL17449537092424685217.gal, -t, CGAL, -LTL, /tmp/LTL6225716169690027125.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/LTL17449537092424685217.gal -t CGAL -LTL /tmp/LTL6225716169690027125.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i26.i1.i1.i1.u449.p1560==1)"))||(X(X(F("((i20.u283.p1037==0)||(i17.u257.p930==1))"))))))
Formula 0 simplified : !(F"(i26.i1.i1.i1.u449.p1560==1)" | XXF"((i20.u283.p1037==0)||(i17.u257.p930==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5561738189626556402
[2021-05-08 12:01:07] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5561738189626556402
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/ltsmin5561738189626556402]
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/ltsmin5561738189626556402] 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/ltsmin5561738189626556402] 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-24b-12 finished in 46897 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((p0&&G((p1&&(X(G(p1))||p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1741 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1732 transition count 1683
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 1727 transition count 1677
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1726 transition count 1676
Applied a total of 31 rules in 458 ms. Remains 1726 /1741 variables (removed 15) and now considering 1676/1692 (removed 16) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:01:09] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:09] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:01:09] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:11] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:01:11] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:12] [INFO ] Dead Transitions using invariants and state equation in 961 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1726/1741 places, 1676/1692 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s954 1), p1:(OR (EQ s757 0) (EQ s730 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-13 finished in 3875 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (p1 U (G(p1)||(p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1730 transition count 1681
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1730 transition count 1681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1730 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 1725 transition count 1675
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1724 transition count 1674
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1724 transition count 1674
Applied a total of 35 rules in 452 ms. Remains 1724 /1741 variables (removed 17) and now considering 1674/1692 (removed 18) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:01:12] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:13] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:01:13] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:15] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:01:15] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:01:16] [INFO ] Dead Transitions using invariants and state equation in 1038 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/1741 places, 1674/1692 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-24b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND p2 p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=10 dest: 9}, { cond=(AND p2 p1 p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(NEQ s971 1), p1:(NEQ s971 0), p0:(EQ s1035 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-14 finished in 4264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1741 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1741/1741 places, 1692/1692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 1740 transition count 1058
Reduce places removed 633 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 706 rules applied. Total rules applied 1339 place count 1107 transition count 985
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1387 place count 1059 transition count 985
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1387 place count 1059 transition count 785
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 1787 place count 859 transition count 785
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1794 place count 852 transition count 778
Iterating global reduction 3 with 7 rules applied. Total rules applied 1801 place count 852 transition count 778
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1801 place count 852 transition count 775
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1807 place count 849 transition count 775
Performed 337 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 2481 place count 512 transition count 390
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2482 place count 511 transition count 389
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 70 rules applied. Total rules applied 2552 place count 464 transition count 366
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 2575 place count 441 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2575 place count 441 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2623 place count 417 transition count 342
Applied a total of 2623 rules in 148 ms. Remains 417 /1741 variables (removed 1324) and now considering 342/1692 (removed 1350) transitions.
// Phase 1: matrix 342 rows 417 cols
[2021-05-08 12:01:16] [INFO ] Computed 101 place invariants in 1 ms
[2021-05-08 12:01:17] [INFO ] Implicit Places using invariants in 226 ms returned [170, 244, 318, 322, 326, 330, 334, 339, 343, 347, 351, 355, 359, 363, 367, 371, 375, 379, 383, 387, 391, 395, 399, 403, 407, 411, 416]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 226 ms to find 27 implicit places.
[2021-05-08 12:01:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 342 rows 390 cols
[2021-05-08 12:01:17] [INFO ] Computed 74 place invariants in 1 ms
[2021-05-08 12:01:17] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Starting structural reductions, iteration 1 : 390/1741 places, 342/1692 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 365 transition count 317
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 341 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 341 transition count 293
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 100 place count 340 transition count 292
Applied a total of 100 rules in 133 ms. Remains 340 /390 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 340 cols
[2021-05-08 12:01:17] [INFO ] Computed 74 place invariants in 0 ms
[2021-05-08 12:01:17] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 292 rows 340 cols
[2021-05-08 12:01:17] [INFO ] Computed 74 place invariants in 1 ms
[2021-05-08 12:01:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 12:01:18] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 340/1741 places, 292/1692 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s327 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-15 finished in 1257 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4071832436909208942
[2021-05-08 12:01:18] [INFO ] Too many transitions (1692) to apply POR reductions. Disabling POR matrices.
[2021-05-08 12:01:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4071832436909208942
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/ltsmin4071832436909208942]
[2021-05-08 12:01:18] [INFO ] Applying decomposition
[2021-05-08 12:01:18] [INFO ] Flatten gal took : 41 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/graph3902899999096329715.txt, -o, /tmp/graph3902899999096329715.bin, -w, /tmp/graph3902899999096329715.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/graph3902899999096329715.bin, -l, -1, -v, -w, /tmp/graph3902899999096329715.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:01:18] [INFO ] Decomposing Gal with order
[2021-05-08 12:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:01:18] [INFO ] Removed a total of 325 redundant transitions.
[2021-05-08 12:01:18] [INFO ] Flatten gal took : 172 ms
[2021-05-08 12:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-08 12:01:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality12308337053335532499.gal : 14 ms
[2021-05-08 12:01:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality10495043174756706490.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/LTLCardinality12308337053335532499.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10495043174756706490.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/LTLCardinality12308337053335532499.gal -t CGAL -LTL /tmp/LTLCardinality10495043174756706490.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i30.i1.i1.i1.u459.p1560==1)"))||(X(X(F("((i20.u289.p1037==0)||(i18.u262.p930==1))"))))))
Formula 0 simplified : !(F"(i30.i1.i1.i1.u459.p1560==1)" | XXF"((i20.u289.p1037==0)||(i18.u262.p930==1))")
Compilation finished in 15499 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4071832436909208942]
Link finished in 52 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(X(<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4071832436909208942]
LTSmin run took 976 ms.
FORMULA AutoFlight-PT-24b-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620475295742

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

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