fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813593200492
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.140 3600000.00 13152419.00 54538.60 FFFFFF??FFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593200492.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutoFlight-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 538K Mar 5 18:22 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-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678516529380

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 06:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:35:32] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-11 06:35:32] [INFO ] Transformed 2230 places.
[2023-03-11 06:35:32] [INFO ] Transformed 2228 transitions.
[2023-03-11 06:35:32] [INFO ] Found NUPN structural information;
[2023-03-11 06:35:32] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutoFlight-PT-24b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 799 place count 1785 transition count 1736
Iterating global reduction 1 with 138 rules applied. Total rules applied 937 place count 1785 transition count 1736
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 959 place count 1763 transition count 1714
Iterating global reduction 1 with 22 rules applied. Total rules applied 981 place count 1763 transition count 1714
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1001 place count 1743 transition count 1694
Iterating global reduction 1 with 20 rules applied. Total rules applied 1021 place count 1743 transition count 1694
Applied a total of 1021 rules in 944 ms. Remains 1743 /2230 variables (removed 487) and now considering 1694/2228 (removed 534) transitions.
// Phase 1: matrix 1694 rows 1743 cols
[2023-03-11 06:35:33] [INFO ] Computed 148 place invariants in 43 ms
[2023-03-11 06:35:34] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-11 06:35:34] [INFO ] Invariant cache hit.
[2023-03-11 06:35:36] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 3320 ms to find 0 implicit places.
[2023-03-11 06:35:36] [INFO ] Invariant cache hit.
[2023-03-11 06:35:37] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1743/2230 places, 1694/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5174 ms. Remains : 1743/2230 places, 1694/2228 transitions.
Support contains 32 out of 1743 places after structural reductions.
[2023-03-11 06:35:38] [INFO ] Flatten gal took : 139 ms
[2023-03-11 06:35:38] [INFO ] Flatten gal took : 83 ms
[2023-03-11 06:35:38] [INFO ] Input system was already deterministic with 1694 transitions.
Support contains 31 out of 1743 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 06:35:39] [INFO ] Invariant cache hit.
[2023-03-11 06:35:39] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 06:35:40] [INFO ] [Nat]Absence check using 147 positive place invariants in 162 ms returned sat
[2023-03-11 06:35:40] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-11 06:35:43] [INFO ] After 1914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 06:35:43] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 7 ms to minimize.
[2023-03-11 06:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 517 ms
[2023-03-11 06:35:44] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 4 ms to minimize.
[2023-03-11 06:35:44] [INFO ] Deduced a trap composed of 92 places in 462 ms of which 1 ms to minimize.
[2023-03-11 06:35:45] [INFO ] Deduced a trap composed of 214 places in 443 ms of which 3 ms to minimize.
[2023-03-11 06:35:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1754 ms
[2023-03-11 06:35:46] [INFO ] Deduced a trap composed of 185 places in 474 ms of which 2 ms to minimize.
[2023-03-11 06:35:46] [INFO ] Deduced a trap composed of 255 places in 424 ms of which 1 ms to minimize.
[2023-03-11 06:35:47] [INFO ] Deduced a trap composed of 281 places in 440 ms of which 1 ms to minimize.
[2023-03-11 06:35:48] [INFO ] Deduced a trap composed of 281 places in 462 ms of which 1 ms to minimize.
[2023-03-11 06:35:48] [INFO ] Deduced a trap composed of 315 places in 386 ms of which 1 ms to minimize.
[2023-03-11 06:35:48] [INFO ] Deduced a trap composed of 332 places in 414 ms of which 1 ms to minimize.
[2023-03-11 06:35:49] [INFO ] Deduced a trap composed of 326 places in 491 ms of which 2 ms to minimize.
[2023-03-11 06:35:50] [INFO ] Deduced a trap composed of 266 places in 411 ms of which 3 ms to minimize.
[2023-03-11 06:35:50] [INFO ] Deduced a trap composed of 262 places in 409 ms of which 3 ms to minimize.
[2023-03-11 06:35:50] [INFO ] Deduced a trap composed of 332 places in 375 ms of which 1 ms to minimize.
[2023-03-11 06:35:51] [INFO ] Deduced a trap composed of 332 places in 354 ms of which 1 ms to minimize.
[2023-03-11 06:35:51] [INFO ] Deduced a trap composed of 281 places in 369 ms of which 1 ms to minimize.
[2023-03-11 06:35:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6026 ms
[2023-03-11 06:35:52] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 1 ms to minimize.
[2023-03-11 06:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2023-03-11 06:35:54] [INFO ] Deduced a trap composed of 129 places in 542 ms of which 1 ms to minimize.
[2023-03-11 06:35:54] [INFO ] Deduced a trap composed of 281 places in 437 ms of which 1 ms to minimize.
[2023-03-11 06:35:55] [INFO ] Deduced a trap composed of 214 places in 408 ms of which 1 ms to minimize.
[2023-03-11 06:35:55] [INFO ] Deduced a trap composed of 281 places in 401 ms of which 1 ms to minimize.
[2023-03-11 06:35:56] [INFO ] Deduced a trap composed of 214 places in 342 ms of which 1 ms to minimize.
[2023-03-11 06:35:56] [INFO ] Deduced a trap composed of 279 places in 524 ms of which 2 ms to minimize.
[2023-03-11 06:35:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3267 ms
[2023-03-11 06:35:57] [INFO ] Deduced a trap composed of 74 places in 383 ms of which 1 ms to minimize.
[2023-03-11 06:35:58] [INFO ] Deduced a trap composed of 96 places in 344 ms of which 1 ms to minimize.
[2023-03-11 06:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1036 ms
[2023-03-11 06:35:58] [INFO ] After 17192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1199 ms.
[2023-03-11 06:35:59] [INFO ] After 19840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 4 properties in 314 ms.
Support contains 11 out of 1743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1743 transition count 1067
Reduce places removed 627 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 700 rules applied. Total rules applied 1327 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1375 place count 1068 transition count 994
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1375 place count 1068 transition count 796
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1771 place count 870 transition count 796
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1773 place count 868 transition count 794
Iterating global reduction 3 with 2 rules applied. Total rules applied 1775 place count 868 transition count 794
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1775 place count 868 transition count 792
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1779 place count 866 transition count 792
Performed 341 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2461 place count 525 transition count 404
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2462 place count 525 transition count 403
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 3 with 2 rules applied. Total rules applied 2464 place count 524 transition count 402
Free-agglomeration rule applied 95 times.
Iterating global reduction 3 with 95 rules applied. Total rules applied 2559 place count 524 transition count 307
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 2654 place count 429 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2655 place count 428 transition count 306
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 4 with 278 rules applied. Total rules applied 2933 place count 317 transition count 139
Reduce places removed 167 places and 0 transitions.
Iterating post reduction 5 with 167 rules applied. Total rules applied 3100 place count 150 transition count 139
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 43 Pre rules applied. Total rules applied 3100 place count 150 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 3186 place count 107 transition count 96
Applied a total of 3186 rules in 359 ms. Remains 107 /1743 variables (removed 1636) and now considering 96/1694 (removed 1598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 107/1743 places, 96/1694 transitions.
Finished random walk after 3273 steps, including 101 resets, run visited all 9 properties in 87 ms. (steps per millisecond=37 )
Computed a total of 430 stabilizing places and 430 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 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 1742 transition count 1063
Reduce places removed 630 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 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1381 place count 1064 transition count 990
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1381 place count 1064 transition count 792
Deduced a syphon composed of 198 places in 8 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1784 place count 859 transition count 785
Iterating global reduction 3 with 7 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2481 place count 514 transition count 392
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 513 transition count 391
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2554 place count 465 transition count 367
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2578 place count 441 transition count 367
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2578 place count 441 transition count 343
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 2626 place count 417 transition count 343
Applied a total of 2626 rules in 226 ms. Remains 417 /1743 variables (removed 1326) and now considering 343/1694 (removed 1351) transitions.
// Phase 1: matrix 343 rows 417 cols
[2023-03-11 06:36:01] [INFO ] Computed 100 place invariants in 3 ms
[2023-03-11 06:36:01] [INFO ] Implicit Places using invariants in 335 ms returned [171, 245, 319, 323, 327, 331, 335, 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 338 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1743 places, 343/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 365 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 341 transition count 294
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 293
Applied a total of 100 rules in 164 ms. Remains 340 /390 variables (removed 50) and now considering 293/343 (removed 50) transitions.
// Phase 1: matrix 293 rows 340 cols
[2023-03-11 06:36:01] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-11 06:36:01] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-11 06:36:01] [INFO ] Invariant cache hit.
[2023-03-11 06:36:02] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1743 places, 293/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1455 ms. Remains : 340/1743 places, 293/1694 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s137 1) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1230 reset in 528 ms.
Product exploration explored 100000 steps with 1237 reset in 523 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1802 steps, including 22 resets, run visited all 1 properties in 13 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 293/293 transitions.
Applied a total of 0 rules in 42 ms. Remains 340 /340 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-11 06:36:04] [INFO ] Invariant cache hit.
[2023-03-11 06:36:04] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-11 06:36:04] [INFO ] Invariant cache hit.
[2023-03-11 06:36:04] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-11 06:36:04] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 06:36:04] [INFO ] Invariant cache hit.
[2023-03-11 06:36:05] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 881 ms. Remains : 340/340 places, 293/293 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Finished random walk after 546 steps, including 5 resets, run visited all 1 properties in 8 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1232 reset in 430 ms.
Product exploration explored 100000 steps with 1237 reset in 466 ms.
Built C files in :
/tmp/ltsmin10043879922174588754
[2023-03-11 06:36:07] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2023-03-11 06:36:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:07] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2023-03-11 06:36:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:07] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2023-03-11 06:36:07] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:07] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10043879922174588754
Running compilation step : cd /tmp/ltsmin10043879922174588754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin10043879922174588754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin10043879922174588754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11736179974189864009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 340 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 340/340 places, 293/293 transitions.
Applied a total of 0 rules in 24 ms. Remains 340 /340 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-11 06:36:22] [INFO ] Invariant cache hit.
[2023-03-11 06:36:22] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 06:36:22] [INFO ] Invariant cache hit.
[2023-03-11 06:36:22] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-11 06:36:22] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 06:36:22] [INFO ] Invariant cache hit.
[2023-03-11 06:36:23] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 340/340 places, 293/293 transitions.
Built C files in :
/tmp/ltsmin12424090516060960512
[2023-03-11 06:36:23] [INFO ] Computing symmetric may disable matrix : 293 transitions.
[2023-03-11 06:36:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:23] [INFO ] Computing symmetric may enable matrix : 293 transitions.
[2023-03-11 06:36:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:23] [INFO ] Computing Do-Not-Accords matrix : 293 transitions.
[2023-03-11 06:36:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 06:36:23] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12424090516060960512
Running compilation step : cd /tmp/ltsmin12424090516060960512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 600 ms.
Running link step : cd /tmp/ltsmin12424090516060960512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12424090516060960512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15780789660230080427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:36:38] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:36:38] [INFO ] Flatten gal took : 11 ms
[2023-03-11 06:36:38] [INFO ] Time to serialize gal into /tmp/LTL16661545739806390506.gal : 3 ms
[2023-03-11 06:36:38] [INFO ] Time to serialize properties into /tmp/LTL7340317226306957083.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16661545739806390506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1347226712686815445.hoa' '-atoms' '/tmp/LTL7340317226306957083.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7340317226306957083.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1347226712686815445.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.61061e+09 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1424 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.2883,468124,1,0,265,2.09349e+06,24,134,8062,2.59489e+06,664
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24b-LTLFireability-00 finished in 52636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(p1)&&X(p2))))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1742 transition count 1067
Reduce places removed 626 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 699 rules applied. Total rules applied 1325 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1375 place count 1068 transition count 992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1377 place count 1066 transition count 992
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1377 place count 1066 transition count 792
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1784 place count 859 transition count 785
Iterating global reduction 4 with 7 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1791 place count 859 transition count 781
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1799 place count 855 transition count 781
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2475 place count 517 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2476 place count 516 transition count 394
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2548 place count 468 transition count 370
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2572 place count 444 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2572 place count 444 transition count 346
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 2620 place count 420 transition count 346
Applied a total of 2620 rules in 254 ms. Remains 420 /1743 variables (removed 1323) and now considering 346/1694 (removed 1348) transitions.
// Phase 1: matrix 346 rows 420 cols
[2023-03-11 06:36:53] [INFO ] Computed 100 place invariants in 3 ms
[2023-03-11 06:36:53] [INFO ] Implicit Places using invariants in 210 ms returned [378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 419]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 211 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 409/1743 places, 346/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 400 transition count 337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 400 transition count 337
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 52 place count 383 transition count 320
Applied a total of 52 rules in 19 ms. Remains 383 /409 variables (removed 26) and now considering 320/346 (removed 26) transitions.
// Phase 1: matrix 320 rows 383 cols
[2023-03-11 06:36:53] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-11 06:36:54] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-11 06:36:54] [INFO ] Invariant cache hit.
[2023-03-11 06:36:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:36:54] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 383/1743 places, 320/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1321 ms. Remains : 383/1743 places, 320/1694 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) p2))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s358 1), p1:(EQ s245 0), p2:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 103 steps with 1 reset in 3 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-03 finished in 1651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))&&p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 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 1742 transition count 1062
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 1111 transition count 989
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1383 place count 1063 transition count 989
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1383 place count 1063 transition count 790
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1781 place count 864 transition count 790
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1789 place count 856 transition count 782
Iterating global reduction 3 with 8 rules applied. Total rules applied 1797 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1797 place count 856 transition count 777
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1807 place count 851 transition count 777
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2487 place count 511 transition count 389
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 2488 place count 510 transition count 388
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2560 place count 462 transition count 364
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2584 place count 438 transition count 364
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2584 place count 438 transition count 340
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 2632 place count 414 transition count 340
Applied a total of 2632 rules in 168 ms. Remains 414 /1743 variables (removed 1329) and now considering 340/1694 (removed 1354) transitions.
// Phase 1: matrix 340 rows 414 cols
[2023-03-11 06:36:55] [INFO ] Computed 100 place invariants in 7 ms
[2023-03-11 06:36:55] [INFO ] Implicit Places using invariants in 263 ms returned [168, 242, 316, 320, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 413]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 264 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 387/1743 places, 340/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 362 transition count 315
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 340 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 340 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 339 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 339 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 338 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 338 transition count 291
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 337 transition count 290
Applied a total of 100 rules in 109 ms. Remains 337 /387 variables (removed 50) and now considering 290/340 (removed 50) transitions.
// Phase 1: matrix 290 rows 337 cols
[2023-03-11 06:36:55] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-11 06:36:55] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-11 06:36:55] [INFO ] Invariant cache hit.
[2023-03-11 06:36:56] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/1743 places, 290/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1118 ms. Remains : 337/1743 places, 290/1694 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s212 1)), p1:(AND (EQ s146 1) (EQ s212 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 74 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-04 finished in 1251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
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 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 407 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-11 06:36:56] [INFO ] Computed 148 place invariants in 20 ms
[2023-03-11 06:36:57] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-11 06:36:57] [INFO ] Invariant cache hit.
[2023-03-11 06:36:59] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2629 ms to find 0 implicit places.
[2023-03-11 06:36:59] [INFO ] Invariant cache hit.
[2023-03-11 06:37:00] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4053 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1188 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 589 steps with 0 reset in 4 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-05 finished in 4212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
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 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 505 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
[2023-03-11 06:37:01] [INFO ] Invariant cache hit.
[2023-03-11 06:37:01] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-11 06:37:01] [INFO ] Invariant cache hit.
[2023-03-11 06:37:03] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
[2023-03-11 06:37:03] [INFO ] Invariant cache hit.
[2023-03-11 06:37:04] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4106 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1352 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 347 reset in 388 ms.
Product exploration explored 100000 steps with 345 reset in 364 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=76 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 06:37:06] [INFO ] Invariant cache hit.
[2023-03-11 06:37:07] [INFO ] [Real]Absence check using 147 positive place invariants in 125 ms returned sat
[2023-03-11 06:37:07] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-11 06:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:37:18] [INFO ] [Real]Absence check using state equation in 11203 ms returned sat
[2023-03-11 06:37:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:37:19] [INFO ] [Nat]Absence check using 147 positive place invariants in 98 ms returned sat
[2023-03-11 06:37:19] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 06:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:37:25] [INFO ] [Nat]Absence check using state equation in 6019 ms returned sat
[2023-03-11 06:37:25] [INFO ] Computed and/alt/rep : 1671/2327/1671 causal constraints (skipped 2 transitions) in 98 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:37:33] [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 EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 150 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
[2023-03-11 06:37:34] [INFO ] Invariant cache hit.
[2023-03-11 06:37:34] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 06:37:34] [INFO ] Invariant cache hit.
[2023-03-11 06:37:36] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2023-03-11 06:37:36] [INFO ] Invariant cache hit.
[2023-03-11 06:37:37] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3516 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 249 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 06:37:38] [INFO ] Invariant cache hit.
[2023-03-11 06:37:39] [INFO ] [Real]Absence check using 147 positive place invariants in 160 ms returned sat
[2023-03-11 06:37:39] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 06:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:37:50] [INFO ] [Real]Absence check using state equation in 11171 ms returned sat
[2023-03-11 06:37:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:37:51] [INFO ] [Nat]Absence check using 147 positive place invariants in 100 ms returned sat
[2023-03-11 06:37:51] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 06:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:37:57] [INFO ] [Nat]Absence check using state equation in 5821 ms returned sat
[2023-03-11 06:37:57] [INFO ] Computed and/alt/rep : 1671/2327/1671 causal constraints (skipped 2 transitions) in 115 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:38:05] [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 EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 345 reset in 279 ms.
Product exploration explored 100000 steps with 341 reset in 327 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1724/1724 places, 1674/1674 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 1724 transition count 1674
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 1724 transition count 1650
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 602 place count 1724 transition count 1650
Deduced a syphon composed of 800 places in 5 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 824 place count 1724 transition count 1650
Discarding 479 places :
Symmetric choice reduction at 2 with 479 rule applications. Total rules 1303 place count 1245 transition count 1171
Deduced a syphon composed of 321 places in 4 ms
Iterating global reduction 2 with 479 rules applied. Total rules applied 1782 place count 1245 transition count 1171
Performed 411 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 732 places in 1 ms
Iterating global reduction 2 with 411 rules applied. Total rules applied 2193 place count 1245 transition count 1123
Renaming transitions due to excessive name length > 1024 char.
Discarding 265 places :
Symmetric choice reduction at 2 with 265 rule applications. Total rules 2458 place count 980 transition count 858
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 265 rules applied. Total rules applied 2723 place count 980 transition count 858
Deduced a syphon composed of 467 places in 1 ms
Applied a total of 2723 rules in 974 ms. Remains 980 /1724 variables (removed 744) and now considering 858/1674 (removed 816) transitions.
[2023-03-11 06:38:07] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 858 rows 980 cols
[2023-03-11 06:38:07] [INFO ] Computed 148 place invariants in 25 ms
[2023-03-11 06:38:08] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1724 places, 858/1674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1646 ms. Remains : 980/1724 places, 858/1674 transitions.
Built C files in :
/tmp/ltsmin4379646810634150774
[2023-03-11 06:38:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4379646810634150774
Running compilation step : cd /tmp/ltsmin4379646810634150774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4379646810634150774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4379646810634150774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1724 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 175 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-11 06:38:11] [INFO ] Computed 148 place invariants in 18 ms
[2023-03-11 06:38:12] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-11 06:38:12] [INFO ] Invariant cache hit.
[2023-03-11 06:38:14] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
[2023-03-11 06:38:14] [INFO ] Invariant cache hit.
[2023-03-11 06:38:15] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3561 ms. Remains : 1724/1724 places, 1674/1674 transitions.
Built C files in :
/tmp/ltsmin1593680035287347217
[2023-03-11 06:38:15] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1593680035287347217
Running compilation step : cd /tmp/ltsmin1593680035287347217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2996 ms.
Running link step : cd /tmp/ltsmin1593680035287347217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1593680035287347217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18278912685416084023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:38:30] [INFO ] Flatten gal took : 43 ms
[2023-03-11 06:38:30] [INFO ] Flatten gal took : 44 ms
[2023-03-11 06:38:30] [INFO ] Time to serialize gal into /tmp/LTL1140552858638127485.gal : 8 ms
[2023-03-11 06:38:30] [INFO ] Time to serialize properties into /tmp/LTL5288247035903525743.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1140552858638127485.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16830225147077980161.hoa' '-atoms' '/tmp/LTL5288247035903525743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5288247035903525743.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16830225147077980161.hoa
Detected timeout of ITS tools.
[2023-03-11 06:38:45] [INFO ] Flatten gal took : 64 ms
[2023-03-11 06:38:45] [INFO ] Flatten gal took : 44 ms
[2023-03-11 06:38:45] [INFO ] Time to serialize gal into /tmp/LTL6486355678657193985.gal : 26 ms
[2023-03-11 06:38:45] [INFO ] Time to serialize properties into /tmp/LTL2554925122871293912.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6486355678657193985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2554925122871293912.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p1835==1)")))))
Formula 0 simplified : XXG!"(p1835==1)"
Detected timeout of ITS tools.
[2023-03-11 06:39:00] [INFO ] Flatten gal took : 36 ms
[2023-03-11 06:39:00] [INFO ] Applying decomposition
[2023-03-11 06:39:00] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13814778447808184204.txt' '-o' '/tmp/graph13814778447808184204.bin' '-w' '/tmp/graph13814778447808184204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13814778447808184204.bin' '-l' '-1' '-v' '-w' '/tmp/graph13814778447808184204.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:39:00] [INFO ] Decomposing Gal with order
[2023-03-11 06:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:39:01] [INFO ] Removed a total of 329 redundant transitions.
[2023-03-11 06:39:01] [INFO ] Flatten gal took : 117 ms
[2023-03-11 06:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-11 06:39:01] [INFO ] Time to serialize gal into /tmp/LTL284769747258249426.gal : 24 ms
[2023-03-11 06:39:01] [INFO ] Time to serialize properties into /tmp/LTL7064376150745590416.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL284769747258249426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7064376150745590416.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i35.u579.p1835==1)")))))
Formula 0 simplified : XXG!"(i35.u579.p1835==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin617798573356738852
[2023-03-11 06:39:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin617798573356738852
Running compilation step : cd /tmp/ltsmin617798573356738852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2869 ms.
Running link step : cd /tmp/ltsmin617798573356738852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin617798573356738852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 151017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 430 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-11 06:39:31] [INFO ] Computed 148 place invariants in 15 ms
[2023-03-11 06:39:32] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:34] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
[2023-03-11 06:39:34] [INFO ] Invariant cache hit.
[2023-03-11 06:39:35] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3802 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=6 dest: 2}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s206 0), p2:(EQ s48 1), p0:(OR (EQ s703 0) (EQ s1364 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 93 reset in 314 ms.
Product exploration explored 100000 steps with 93 reset in 370 ms.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 440 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:39:37] [INFO ] Invariant cache hit.
[2023-03-11 06:39:37] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:39:37] [INFO ] [Nat]Absence check using 147 positive place invariants in 75 ms returned sat
[2023-03-11 06:39:37] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-11 06:39:38] [INFO ] After 940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:39:39] [INFO ] Deduced a trap composed of 37 places in 448 ms of which 1 ms to minimize.
[2023-03-11 06:39:39] [INFO ] Deduced a trap composed of 245 places in 469 ms of which 1 ms to minimize.
[2023-03-11 06:39:40] [INFO ] Deduced a trap composed of 281 places in 437 ms of which 1 ms to minimize.
[2023-03-11 06:39:40] [INFO ] Deduced a trap composed of 214 places in 456 ms of which 1 ms to minimize.
[2023-03-11 06:39:41] [INFO ] Deduced a trap composed of 214 places in 420 ms of which 1 ms to minimize.
[2023-03-11 06:39:41] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 1 ms to minimize.
[2023-03-11 06:39:42] [INFO ] Deduced a trap composed of 214 places in 390 ms of which 1 ms to minimize.
[2023-03-11 06:39:42] [INFO ] Deduced a trap composed of 216 places in 374 ms of which 1 ms to minimize.
[2023-03-11 06:39:43] [INFO ] Deduced a trap composed of 214 places in 403 ms of which 1 ms to minimize.
[2023-03-11 06:39:43] [INFO ] Deduced a trap composed of 251 places in 484 ms of which 1 ms to minimize.
[2023-03-11 06:39:44] [INFO ] Deduced a trap composed of 216 places in 447 ms of which 2 ms to minimize.
[2023-03-11 06:39:44] [INFO ] Deduced a trap composed of 255 places in 478 ms of which 1 ms to minimize.
[2023-03-11 06:39:45] [INFO ] Deduced a trap composed of 216 places in 546 ms of which 3 ms to minimize.
[2023-03-11 06:39:45] [INFO ] Deduced a trap composed of 243 places in 439 ms of which 1 ms to minimize.
[2023-03-11 06:39:46] [INFO ] Deduced a trap composed of 291 places in 384 ms of which 1 ms to minimize.
[2023-03-11 06:39:46] [INFO ] Deduced a trap composed of 214 places in 390 ms of which 1 ms to minimize.
[2023-03-11 06:39:47] [INFO ] Deduced a trap composed of 214 places in 484 ms of which 1 ms to minimize.
[2023-03-11 06:39:47] [INFO ] Deduced a trap composed of 243 places in 485 ms of which 1 ms to minimize.
[2023-03-11 06:39:48] [INFO ] Deduced a trap composed of 285 places in 423 ms of which 1 ms to minimize.
[2023-03-11 06:39:48] [INFO ] Deduced a trap composed of 281 places in 431 ms of which 2 ms to minimize.
[2023-03-11 06:39:49] [INFO ] Deduced a trap composed of 281 places in 398 ms of which 2 ms to minimize.
[2023-03-11 06:39:49] [INFO ] Deduced a trap composed of 214 places in 446 ms of which 1 ms to minimize.
[2023-03-11 06:39:50] [INFO ] Deduced a trap composed of 286 places in 471 ms of which 1 ms to minimize.
[2023-03-11 06:39:50] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 11743 ms
[2023-03-11 06:39:50] [INFO ] After 12789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-11 06:39:50] [INFO ] After 13270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 735 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 7 factoid took 624 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2023-03-11 06:39:52] [INFO ] Invariant cache hit.
[2023-03-11 06:39:53] [INFO ] [Real]Absence check using 147 positive place invariants in 110 ms returned sat
[2023-03-11 06:39:53] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 23 ms returned sat
[2023-03-11 06:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:01] [INFO ] [Real]Absence check using state equation in 8197 ms returned sat
[2023-03-11 06:40:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:02] [INFO ] [Nat]Absence check using 147 positive place invariants in 84 ms returned sat
[2023-03-11 06:40:02] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-11 06:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:03] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-11 06:40:04] [INFO ] Deduced a trap composed of 131 places in 440 ms of which 1 ms to minimize.
[2023-03-11 06:40:04] [INFO ] Deduced a trap composed of 224 places in 454 ms of which 1 ms to minimize.
[2023-03-11 06:40:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1116 ms
[2023-03-11 06:40:04] [INFO ] Computed and/alt/rep : 1675/2331/1675 causal constraints (skipped 2 transitions) in 89 ms.
[2023-03-11 06:40:17] [INFO ] Deduced a trap composed of 8 places in 953 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:40:17] [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 EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 2 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 111 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2023-03-11 06:40:17] [INFO ] Invariant cache hit.
[2023-03-11 06:40:18] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-11 06:40:18] [INFO ] Invariant cache hit.
[2023-03-11 06:40:19] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
[2023-03-11 06:40:19] [INFO ] Invariant cache hit.
[2023-03-11 06:40:20] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3580 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Computed a total of 418 stabilizing places and 418 stable transitions
Computed a total of 418 stabilizing places and 418 stable transitions
Detected a total of 418/1728 stabilizing places and 418/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:40:21] [INFO ] Invariant cache hit.
[2023-03-11 06:40:21] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:40:22] [INFO ] [Nat]Absence check using 147 positive place invariants in 86 ms returned sat
[2023-03-11 06:40:22] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:23] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:40:23] [INFO ] Deduced a trap composed of 37 places in 423 ms of which 1 ms to minimize.
[2023-03-11 06:40:24] [INFO ] Deduced a trap composed of 245 places in 399 ms of which 1 ms to minimize.
[2023-03-11 06:40:24] [INFO ] Deduced a trap composed of 281 places in 454 ms of which 1 ms to minimize.
[2023-03-11 06:40:25] [INFO ] Deduced a trap composed of 214 places in 489 ms of which 1 ms to minimize.
[2023-03-11 06:40:25] [INFO ] Deduced a trap composed of 214 places in 455 ms of which 1 ms to minimize.
[2023-03-11 06:40:26] [INFO ] Deduced a trap composed of 214 places in 442 ms of which 1 ms to minimize.
[2023-03-11 06:40:26] [INFO ] Deduced a trap composed of 214 places in 457 ms of which 1 ms to minimize.
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 216 places in 400 ms of which 1 ms to minimize.
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 214 places in 426 ms of which 1 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 251 places in 611 ms of which 2 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 216 places in 487 ms of which 2 ms to minimize.
[2023-03-11 06:40:29] [INFO ] Deduced a trap composed of 255 places in 393 ms of which 1 ms to minimize.
[2023-03-11 06:40:29] [INFO ] Deduced a trap composed of 216 places in 376 ms of which 1 ms to minimize.
[2023-03-11 06:40:30] [INFO ] Deduced a trap composed of 243 places in 445 ms of which 1 ms to minimize.
[2023-03-11 06:40:30] [INFO ] Deduced a trap composed of 291 places in 393 ms of which 1 ms to minimize.
[2023-03-11 06:40:31] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 1 ms to minimize.
[2023-03-11 06:40:31] [INFO ] Deduced a trap composed of 214 places in 389 ms of which 1 ms to minimize.
[2023-03-11 06:40:32] [INFO ] Deduced a trap composed of 243 places in 387 ms of which 1 ms to minimize.
[2023-03-11 06:40:32] [INFO ] Deduced a trap composed of 285 places in 435 ms of which 1 ms to minimize.
[2023-03-11 06:40:33] [INFO ] Deduced a trap composed of 281 places in 402 ms of which 0 ms to minimize.
[2023-03-11 06:40:33] [INFO ] Deduced a trap composed of 281 places in 444 ms of which 1 ms to minimize.
[2023-03-11 06:40:34] [INFO ] Deduced a trap composed of 214 places in 411 ms of which 1 ms to minimize.
[2023-03-11 06:40:34] [INFO ] Deduced a trap composed of 286 places in 417 ms of which 1 ms to minimize.
[2023-03-11 06:40:34] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 11562 ms
[2023-03-11 06:40:34] [INFO ] After 12649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-11 06:40:34] [INFO ] After 13071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 737 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
[2023-03-11 06:40:35] [INFO ] Invariant cache hit.
[2023-03-11 06:40:36] [INFO ] [Real]Absence check using 147 positive place invariants in 109 ms returned sat
[2023-03-11 06:40:36] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-11 06:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:45] [INFO ] [Real]Absence check using state equation in 8498 ms returned sat
[2023-03-11 06:40:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:46] [INFO ] [Nat]Absence check using 147 positive place invariants in 78 ms returned sat
[2023-03-11 06:40:46] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-11 06:40:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:47] [INFO ] [Nat]Absence check using state equation in 1629 ms returned sat
[2023-03-11 06:40:48] [INFO ] Deduced a trap composed of 131 places in 431 ms of which 1 ms to minimize.
[2023-03-11 06:40:48] [INFO ] Deduced a trap composed of 224 places in 422 ms of which 1 ms to minimize.
[2023-03-11 06:40:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2023-03-11 06:40:48] [INFO ] Computed and/alt/rep : 1675/2331/1675 causal constraints (skipped 2 transitions) in 95 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 06:41:00] [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 EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 93 reset in 442 ms.
Product exploration explored 100000 steps with 93 reset in 452 ms.
Applying partial POR strategy [true, true, false, false, false, true]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1728 transition count 1678
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 604 place count 1728 transition count 1654
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 604 place count 1728 transition count 1654
Deduced a syphon composed of 801 places in 6 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 825 place count 1728 transition count 1654
Discarding 480 places :
Symmetric choice reduction at 2 with 480 rule applications. Total rules 1305 place count 1248 transition count 1174
Deduced a syphon composed of 321 places in 4 ms
Iterating global reduction 2 with 480 rules applied. Total rules applied 1785 place count 1248 transition count 1174
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 733 places in 1 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2197 place count 1248 transition count 1126
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 2 with 266 rule applications. Total rules 2463 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 266 rules applied. Total rules applied 2729 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2729 rules in 379 ms. Remains 982 /1728 variables (removed 746) and now considering 860/1678 (removed 818) transitions.
[2023-03-11 06:41:02] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 860 rows 982 cols
[2023-03-11 06:41:02] [INFO ] Computed 148 place invariants in 18 ms
[2023-03-11 06:41:02] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 982/1728 places, 860/1678 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 922 ms. Remains : 982/1728 places, 860/1678 transitions.
Built C files in :
/tmp/ltsmin3058147465418802459
[2023-03-11 06:41:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3058147465418802459
Running compilation step : cd /tmp/ltsmin3058147465418802459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2821 ms.
Running link step : cd /tmp/ltsmin3058147465418802459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3058147465418802459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12618071732348044952.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 67 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-11 06:41:17] [INFO ] Computed 148 place invariants in 15 ms
[2023-03-11 06:41:18] [INFO ] Implicit Places using invariants in 805 ms returned []
[2023-03-11 06:41:18] [INFO ] Invariant cache hit.
[2023-03-11 06:41:20] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2023-03-11 06:41:20] [INFO ] Invariant cache hit.
[2023-03-11 06:41:21] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3950 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Built C files in :
/tmp/ltsmin8714056029648295558
[2023-03-11 06:41:21] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8714056029648295558
Running compilation step : cd /tmp/ltsmin8714056029648295558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2874 ms.
Running link step : cd /tmp/ltsmin8714056029648295558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin8714056029648295558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4925530123356793275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:41:37] [INFO ] Flatten gal took : 42 ms
[2023-03-11 06:41:37] [INFO ] Flatten gal took : 40 ms
[2023-03-11 06:41:37] [INFO ] Time to serialize gal into /tmp/LTL8452396570293043344.gal : 7 ms
[2023-03-11 06:41:37] [INFO ] Time to serialize properties into /tmp/LTL2834531501475886060.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8452396570293043344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1135106857703328191.hoa' '-atoms' '/tmp/LTL2834531501475886060.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2834531501475886060.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1135106857703328191.hoa
Detected timeout of ITS tools.
[2023-03-11 06:41:52] [INFO ] Flatten gal took : 38 ms
[2023-03-11 06:41:52] [INFO ] Flatten gal took : 33 ms
[2023-03-11 06:41:52] [INFO ] Time to serialize gal into /tmp/LTL3194500308579468628.gal : 18 ms
[2023-03-11 06:41:52] [INFO ] Time to serialize properties into /tmp/LTL3543441553544626105.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3194500308579468628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3543441553544626105.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(((F("((p1091==0)||(p1843==0))"))&&(G("(p262==0)")))&&(F("(p48==1)"))))))
Formula 0 simplified : XX(G!"((p1091==0)||(p1843==0))" | F!"(p262==0)" | G!"(p48==1)")
Detected timeout of ITS tools.
[2023-03-11 06:42:07] [INFO ] Flatten gal took : 31 ms
[2023-03-11 06:42:07] [INFO ] Applying decomposition
[2023-03-11 06:42:07] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4626104080049173630.txt' '-o' '/tmp/graph4626104080049173630.bin' '-w' '/tmp/graph4626104080049173630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4626104080049173630.bin' '-l' '-1' '-v' '-w' '/tmp/graph4626104080049173630.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:42:07] [INFO ] Decomposing Gal with order
[2023-03-11 06:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:42:07] [INFO ] Removed a total of 329 redundant transitions.
[2023-03-11 06:42:07] [INFO ] Flatten gal took : 67 ms
[2023-03-11 06:42:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-11 06:42:07] [INFO ] Time to serialize gal into /tmp/LTL3950880272867417901.gal : 11 ms
[2023-03-11 06:42:07] [INFO ] Time to serialize properties into /tmp/LTL2364541108735589724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3950880272867417901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2364541108735589724.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(((F("((i20.u299.p1091==0)||(i20.u571.p1843==0))"))&&(G("(i12.u89.p262==0)")))&&(F("(i20.u21.p48==1)"))))))
Formula 0 simplified : XX(G!"((i20.u299.p1091==0)||(i20.u571.p1843==0))" | F!"(i12.u89.p262==0)" | G!"(i20.u21.p48==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6429009147241172783
[2023-03-11 06:42:22] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6429009147241172783
Running compilation step : cd /tmp/ltsmin6429009147241172783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2904 ms.
Running link step : cd /tmp/ltsmin6429009147241172783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin6429009147241172783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&[]((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-24b-LTLFireability-07 finished in 186446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1734 transition count 1685
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1734 transition count 1685
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 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 451 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2023-03-11 06:42:38] [INFO ] Computed 148 place invariants in 14 ms
[2023-03-11 06:42:38] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-11 06:42:38] [INFO ] Invariant cache hit.
[2023-03-11 06:42:40] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2449 ms to find 0 implicit places.
[2023-03-11 06:42:40] [INFO ] Invariant cache hit.
[2023-03-11 06:42:41] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3751 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s850 0), p0:(AND (EQ s493 1) (EQ s1129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, 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 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-08 finished in 3894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&G(F(p2))))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 397 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-11 06:42:42] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-11 06:42:42] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-11 06:42:42] [INFO ] Invariant cache hit.
[2023-03-11 06:42:44] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
[2023-03-11 06:42:44] [INFO ] Invariant cache hit.
[2023-03-11 06:42:45] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3641 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s284 1), p1:(EQ s1685 1), p2:(OR (EQ s224 0) (EQ s1294 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1057 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-09 finished in 3885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||F((X(p2)||p2))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1736 transition count 1687
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1736 transition count 1687
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1731 transition count 1682
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1731 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1730 transition count 1681
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1730 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1729 transition count 1680
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1729 transition count 1680
Applied a total of 28 rules in 341 ms. Remains 1729 /1743 variables (removed 14) and now considering 1680/1694 (removed 14) transitions.
// Phase 1: matrix 1680 rows 1729 cols
[2023-03-11 06:42:46] [INFO ] Computed 148 place invariants in 12 ms
[2023-03-11 06:42:46] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-11 06:42:46] [INFO ] Invariant cache hit.
[2023-03-11 06:42:48] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2023-03-11 06:42:48] [INFO ] Invariant cache hit.
[2023-03-11 06:42:49] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1729/1743 places, 1680/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3829 ms. Remains : 1729/1743 places, 1680/1694 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s904 1) (EQ s1620 1)), p1:(EQ s161 1), p0:(EQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1055 steps with 0 reset in 8 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-10 finished in 4045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1742 transition count 1064
Reduce places removed 629 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 699 rules applied. Total rules applied 1328 place count 1113 transition count 994
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 47 rules applied. Total rules applied 1375 place count 1067 transition count 993
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1378 place count 1066 transition count 991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1379 place count 1065 transition count 991
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 199 Pre rules applied. Total rules applied 1379 place count 1065 transition count 792
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 5 with 398 rules applied. Total rules applied 1777 place count 866 transition count 792
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1785 place count 858 transition count 784
Iterating global reduction 5 with 8 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 5 with 680 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
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 5 with 70 rules applied. Total rules applied 2554 place count 465 transition count 367
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 2577 place count 442 transition count 367
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2577 place count 442 transition count 343
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2625 place count 418 transition count 343
Applied a total of 2625 rules in 146 ms. Remains 418 /1743 variables (removed 1325) and now considering 343/1694 (removed 1351) transitions.
// Phase 1: matrix 343 rows 418 cols
[2023-03-11 06:42:49] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-11 06:42:50] [INFO ] Implicit Places using invariants in 238 ms returned [171, 245, 319, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 412, 417]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 239 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/1743 places, 343/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 366 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 365 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 342 transition count 294
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 341 transition count 293
Applied a total of 100 rules in 119 ms. Remains 341 /391 variables (removed 50) and now considering 293/343 (removed 50) transitions.
// Phase 1: matrix 293 rows 341 cols
[2023-03-11 06:42:50] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-11 06:42:50] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-11 06:42:50] [INFO ] Invariant cache hit.
[2023-03-11 06:42:50] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 341/1743 places, 293/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1112 ms. Remains : 341/1743 places, 293/1694 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s170 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 75 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-11 finished in 1159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((X(p1)||G(p2))))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 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 1742 transition count 1063
Reduce places removed 630 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 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1381 place count 1064 transition count 990
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1381 place count 1064 transition count 791
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1779 place count 865 transition count 791
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1785 place count 859 transition count 785
Iterating global reduction 3 with 6 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2477 place count 516 transition count 394
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 2478 place count 515 transition count 393
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2550 place count 467 transition count 369
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2574 place count 443 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 2574 place count 443 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 2622 place count 419 transition count 345
Applied a total of 2622 rules in 145 ms. Remains 419 /1743 variables (removed 1324) and now considering 345/1694 (removed 1349) transitions.
// Phase 1: matrix 345 rows 419 cols
[2023-03-11 06:42:51] [INFO ] Computed 100 place invariants in 3 ms
[2023-03-11 06:42:51] [INFO ] Implicit Places using invariants in 335 ms returned [173, 247, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 418]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 336 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/1743 places, 345/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 367 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 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 0 with 2 rules applied. Total rules applied 56 place count 364 transition count 317
Applied a total of 56 rules in 26 ms. Remains 364 /392 variables (removed 28) and now considering 317/345 (removed 28) transitions.
// Phase 1: matrix 317 rows 364 cols
[2023-03-11 06:42:51] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-11 06:42:51] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-11 06:42:51] [INFO ] Invariant cache hit.
[2023-03-11 06:42:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-11 06:42:52] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 364/1743 places, 317/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1547 ms. Remains : 364/1743 places, 317/1694 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p2:(EQ s22 1), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-12 finished in 1785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&((!p0&&G(p1)) U p2)))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1735 transition count 1686
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1735 transition count 1686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1735 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1730 transition count 1680
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 386 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-11 06:42:53] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-11 06:42:53] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-11 06:42:53] [INFO ] Invariant cache hit.
[2023-03-11 06:42:56] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 3166 ms to find 0 implicit places.
[2023-03-11 06:42:56] [INFO ] Invariant cache hit.
[2023-03-11 06:42:57] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4446 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1701 1), p2:(EQ s478 1), p1:(EQ s606 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLFireability-14 finished in 4861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : AutoFlight-PT-24b-LTLFireability-06
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 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 1742 transition count 1063
Reduce places removed 630 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 703 rules applied. Total rules applied 1333 place count 1112 transition count 990
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1382 place count 1064 transition count 989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1383 place count 1063 transition count 989
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1383 place count 1063 transition count 790
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1781 place count 864 transition count 790
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1789 place count 856 transition count 782
Iterating global reduction 4 with 8 rules applied. Total rules applied 1797 place count 856 transition count 782
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1797 place count 856 transition count 777
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1807 place count 851 transition count 777
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
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 2628 place count 416 transition count 342
Applied a total of 2628 rules in 177 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2023-03-11 06:42:58] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-11 06:42:58] [INFO ] Implicit Places using invariants in 265 ms returned [326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 266 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 393/1743 places, 342/1694 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 372 transition count 321
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 372 transition count 321
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 367 transition count 316
Applied a total of 52 rules in 14 ms. Remains 367 /393 variables (removed 26) and now considering 316/342 (removed 26) transitions.
// Phase 1: matrix 316 rows 367 cols
[2023-03-11 06:42:58] [INFO ] Computed 77 place invariants in 1 ms
[2023-03-11 06:42:58] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-11 06:42:58] [INFO ] Invariant cache hit.
[2023-03-11 06:42:58] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 367/1743 places, 316/1694 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1098 ms. Remains : 367/1743 places, 316/1694 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s318 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2283 reset in 506 ms.
Stack based approach found an accepted trace after 20771 steps with 476 reset with depth 48 and stack size 48 in 92 ms.
Treatment of property AutoFlight-PT-24b-LTLFireability-06 finished in 2012 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)&&F(p2)))))'
[2023-03-11 06:42:59] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5667631594614671285
[2023-03-11 06:42:59] [INFO ] Too many transitions (1694) to apply POR reductions. Disabling POR matrices.
[2023-03-11 06:42:59] [INFO ] Applying decomposition
[2023-03-11 06:42:59] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5667631594614671285
Running compilation step : cd /tmp/ltsmin5667631594614671285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 06:42:59] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1609852734734664920.txt' '-o' '/tmp/graph1609852734734664920.bin' '-w' '/tmp/graph1609852734734664920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1609852734734664920.bin' '-l' '-1' '-v' '-w' '/tmp/graph1609852734734664920.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:43:00] [INFO ] Decomposing Gal with order
[2023-03-11 06:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:43:00] [INFO ] Removed a total of 326 redundant transitions.
[2023-03-11 06:43:00] [INFO ] Flatten gal took : 83 ms
[2023-03-11 06:43:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-11 06:43:00] [INFO ] Time to serialize gal into /tmp/LTLFireability12978108865221942876.gal : 23 ms
[2023-03-11 06:43:00] [INFO ] Time to serialize properties into /tmp/LTLFireability16841998600220509956.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12978108865221942876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16841998600220509956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(i30.i0.i1.u580.p1835==1)")))))
Formula 0 simplified : XXG!"(i30.i0.i1.u580.p1835==1)"
Compilation finished in 2975 ms.
Running link step : cd /tmp/ltsmin5667631594614671285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin5667631594614671285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:05:32] [INFO ] Applying decomposition
[2023-03-11 07:05:33] [INFO ] Flatten gal took : 249 ms
[2023-03-11 07:05:33] [INFO ] Decomposing Gal with order
[2023-03-11 07:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:05:35] [INFO ] Removed a total of 50 redundant transitions.
[2023-03-11 07:05:35] [INFO ] Flatten gal took : 163 ms
[2023-03-11 07:05:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 2105 ms.
[2023-03-11 07:05:38] [INFO ] Time to serialize gal into /tmp/LTLFireability759099463175426504.gal : 164 ms
[2023-03-11 07:05:38] [INFO ] Time to serialize properties into /tmp/LTLFireability1666652472568151453.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability759099463175426504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1666652472568151453.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p1835==1)")))))
Formula 0 simplified : XXG!"(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u269.p1835==1)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5667631594614671285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5667631594614671285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp1==true))&&[]((LTLAPp2==true))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:28:12] [INFO ] Flatten gal took : 475 ms
[2023-03-11 07:28:15] [INFO ] Input system was already deterministic with 1694 transitions.
[2023-03-11 07:28:15] [INFO ] Transformed 1743 places.
[2023-03-11 07:28:15] [INFO ] Transformed 1694 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 07:28:16] [INFO ] Time to serialize gal into /tmp/LTLFireability15887797510201269049.gal : 23 ms
[2023-03-11 07:28:16] [INFO ] Time to serialize properties into /tmp/LTLFireability6422235835885344169.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15887797510201269049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6422235835885344169.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F("(p1835==1)")))))
Formula 0 simplified : XXG!"(p1835==1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10715264 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16204968 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-24b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593200492"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;