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-167813593200491.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200491
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678516518832

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 06:35:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:35:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:35:21] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-11 06:35:21] [INFO ] Transformed 2230 places.
[2023-03-11 06:35:21] [INFO ] Transformed 2228 transitions.
[2023-03-11 06:35:21] [INFO ] Found NUPN structural information;
[2023-03-11 06:35:21] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-24b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 1928 transition count 1926
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 1928 transition count 1926
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 651 place count 1928 transition count 1879
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 785 place count 1794 transition count 1745
Iterating global reduction 1 with 134 rules applied. Total rules applied 919 place count 1794 transition count 1745
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 943 place count 1770 transition count 1721
Iterating global reduction 1 with 24 rules applied. Total rules applied 967 place count 1770 transition count 1721
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 986 place count 1751 transition count 1702
Iterating global reduction 1 with 19 rules applied. Total rules applied 1005 place count 1751 transition count 1702
Applied a total of 1005 rules in 1166 ms. Remains 1751 /2230 variables (removed 479) and now considering 1702/2228 (removed 526) transitions.
// Phase 1: matrix 1702 rows 1751 cols
[2023-03-11 06:35:23] [INFO ] Computed 148 place invariants in 27 ms
[2023-03-11 06:35:24] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2023-03-11 06:35:24] [INFO ] Invariant cache hit.
[2023-03-11 06:35:26] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 3587 ms to find 0 implicit places.
[2023-03-11 06:35:26] [INFO ] Invariant cache hit.
[2023-03-11 06:35:28] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1751/2230 places, 1702/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6054 ms. Remains : 1751/2230 places, 1702/2228 transitions.
Support contains 28 out of 1751 places after structural reductions.
[2023-03-11 06:35:28] [INFO ] Flatten gal took : 166 ms
[2023-03-11 06:35:28] [INFO ] Flatten gal took : 58 ms
[2023-03-11 06:35:28] [INFO ] Input system was already deterministic with 1702 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 06:35:29] [INFO ] Invariant cache hit.
[2023-03-11 06:35:29] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:35:30] [INFO ] [Nat]Absence check using 147 positive place invariants in 91 ms returned sat
[2023-03-11 06:35:30] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 06:35:32] [INFO ] After 1823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 06:35:33] [INFO ] Deduced a trap composed of 124 places in 617 ms of which 8 ms to minimize.
[2023-03-11 06:35:33] [INFO ] Deduced a trap composed of 108 places in 512 ms of which 1 ms to minimize.
[2023-03-11 06:35:34] [INFO ] Deduced a trap composed of 158 places in 580 ms of which 3 ms to minimize.
[2023-03-11 06:35:35] [INFO ] Deduced a trap composed of 136 places in 438 ms of which 1 ms to minimize.
[2023-03-11 06:35:35] [INFO ] Deduced a trap composed of 77 places in 560 ms of which 5 ms to minimize.
[2023-03-11 06:35:36] [INFO ] Deduced a trap composed of 167 places in 511 ms of which 2 ms to minimize.
[2023-03-11 06:35:36] [INFO ] Deduced a trap composed of 128 places in 382 ms of which 3 ms to minimize.
[2023-03-11 06:35:37] [INFO ] Deduced a trap composed of 165 places in 480 ms of which 1 ms to minimize.
[2023-03-11 06:35:37] [INFO ] Deduced a trap composed of 152 places in 346 ms of which 1 ms to minimize.
[2023-03-11 06:35:38] [INFO ] Deduced a trap composed of 147 places in 504 ms of which 1 ms to minimize.
[2023-03-11 06:35:38] [INFO ] Deduced a trap composed of 170 places in 391 ms of which 1 ms to minimize.
[2023-03-11 06:35:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6214 ms
[2023-03-11 06:35:39] [INFO ] Deduced a trap composed of 27 places in 348 ms of which 1 ms to minimize.
[2023-03-11 06:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2023-03-11 06:35:40] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 0 ms to minimize.
[2023-03-11 06:35:40] [INFO ] Deduced a trap composed of 128 places in 358 ms of which 1 ms to minimize.
[2023-03-11 06:35:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 910 ms
[2023-03-11 06:35:41] [INFO ] Deduced a trap composed of 210 places in 463 ms of which 1 ms to minimize.
[2023-03-11 06:35:42] [INFO ] Deduced a trap composed of 247 places in 433 ms of which 2 ms to minimize.
[2023-03-11 06:35:42] [INFO ] Deduced a trap composed of 120 places in 404 ms of which 2 ms to minimize.
[2023-03-11 06:35:43] [INFO ] Deduced a trap composed of 123 places in 441 ms of which 1 ms to minimize.
[2023-03-11 06:35:43] [INFO ] Deduced a trap composed of 131 places in 373 ms of which 1 ms to minimize.
[2023-03-11 06:35:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2612 ms
[2023-03-11 06:35:44] [INFO ] After 13203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 788 ms.
[2023-03-11 06:35:44] [INFO ] After 14926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 478 ms.
Support contains 6 out of 1751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1751/1751 places, 1702/1702 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 1751 transition count 1073
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 700 rules applied. Total rules applied 1329 place count 1122 transition count 1002
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 1376 place count 1076 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1377 place count 1075 transition count 1001
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1377 place count 1075 transition count 802
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1775 place count 876 transition count 802
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1787 place count 864 transition count 790
Iterating global reduction 4 with 12 rules applied. Total rules applied 1799 place count 864 transition count 790
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1799 place count 864 transition count 782
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1815 place count 856 transition count 782
Performed 336 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2487 place count 520 transition count 399
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2489 place count 519 transition count 399
Free-agglomeration rule applied 94 times.
Iterating global reduction 4 with 94 rules applied. Total rules applied 2583 place count 519 transition count 305
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 4 with 94 rules applied. Total rules applied 2677 place count 425 transition count 305
Applied a total of 2677 rules in 303 ms. Remains 425 /1751 variables (removed 1326) and now considering 305/1702 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 425/1751 places, 305/1702 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Finished Best-First random walk after 4324 steps, including 4 resets, run visited all 2 properties in 16 ms. (steps per millisecond=270 )
Computed a total of 429 stabilizing places and 429 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' '!(X(X(F((F(p1)&&p0)))))'
Support contains 2 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1737 transition count 1688
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1737 transition count 1688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1728 transition count 1679
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1728 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1726 transition count 1677
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1726 transition count 1677
Applied a total of 50 rules in 618 ms. Remains 1726 /1751 variables (removed 25) and now considering 1677/1702 (removed 25) transitions.
// Phase 1: matrix 1677 rows 1726 cols
[2023-03-11 06:35:46] [INFO ] Computed 148 place invariants in 43 ms
[2023-03-11 06:35:47] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-11 06:35:47] [INFO ] Invariant cache hit.
[2023-03-11 06:35:49] [INFO ] Implicit Places using invariants and state equation in 2247 ms returned []
Implicit Place search using SMT with State Equation took 2883 ms to find 0 implicit places.
[2023-03-11 06:35:49] [INFO ] Invariant cache hit.
[2023-03-11 06:35:50] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1751 places, 1677/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4595 ms. Remains : 1726/1751 places, 1677/1702 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s538 0) (EQ s633 1)), p0:(AND (EQ s633 0) (EQ s538 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]]
Stuttering criterion allowed to conclude after 4447 steps with 5 reset in 54 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-00 finished in 5109 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((X(p1)||p0))))'
Support contains 4 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1736 transition count 1687
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1736 transition count 1687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1736 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1727 transition count 1677
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1725 transition count 1675
Applied a total of 53 rules in 376 ms. Remains 1725 /1751 variables (removed 26) and now considering 1675/1702 (removed 27) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2023-03-11 06:35:51] [INFO ] Computed 148 place invariants in 19 ms
[2023-03-11 06:35:52] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-03-11 06:35:52] [INFO ] Invariant cache hit.
[2023-03-11 06:35:54] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
[2023-03-11 06:35:54] [INFO ] Invariant cache hit.
[2023-03-11 06:35:55] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1751 places, 1675/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4082 ms. Remains : 1725/1751 places, 1675/1702 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s224 0) (EQ s96 1)), p1:(OR (EQ s234 0) (EQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 94 reset in 423 ms.
Product exploration explored 100000 steps with 93 reset in 444 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 743 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:35:57] [INFO ] Invariant cache hit.
[2023-03-11 06:35:57] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:35:57] [INFO ] [Nat]Absence check using 147 positive place invariants in 77 ms returned sat
[2023-03-11 06:35:57] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 06:35:58] [INFO ] After 810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:35:59] [INFO ] Deduced a trap composed of 129 places in 540 ms of which 1 ms to minimize.
[2023-03-11 06:35:59] [INFO ] Deduced a trap composed of 131 places in 465 ms of which 14 ms to minimize.
[2023-03-11 06:36:00] [INFO ] Deduced a trap composed of 190 places in 469 ms of which 5 ms to minimize.
[2023-03-11 06:36:00] [INFO ] Deduced a trap composed of 157 places in 428 ms of which 1 ms to minimize.
[2023-03-11 06:36:01] [INFO ] Deduced a trap composed of 170 places in 442 ms of which 1 ms to minimize.
[2023-03-11 06:36:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2797 ms
[2023-03-11 06:36:02] [INFO ] Deduced a trap composed of 136 places in 451 ms of which 1 ms to minimize.
[2023-03-11 06:36:02] [INFO ] Deduced a trap composed of 281 places in 420 ms of which 1 ms to minimize.
[2023-03-11 06:36:03] [INFO ] Deduced a trap composed of 214 places in 403 ms of which 1 ms to minimize.
[2023-03-11 06:36:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1615 ms
[2023-03-11 06:36:03] [INFO ] After 5342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-11 06:36:03] [INFO ] After 5920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 73 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Drop transitions removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1725 transition count 1052
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 695 rules applied. Total rules applied 1318 place count 1102 transition count 980
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 1367 place count 1054 transition count 979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1368 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1766 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 4 with 676 rules applied. Total rules applied 2442 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2537 place count 516 transition count 299
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2632 place count 421 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2633 place count 420 transition count 298
Reduce places removed 92 places and 0 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 5 with 228 rules applied. Total rules applied 2861 place count 328 transition count 162
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 6 with 136 rules applied. Total rules applied 2997 place count 192 transition count 162
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 2997 place count 192 transition count 132
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3057 place count 162 transition count 132
Applied a total of 3057 rules in 163 ms. Remains 162 /1725 variables (removed 1563) and now considering 132/1675 (removed 1543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 162/1725 places, 132/1675 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 254 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=254 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 11 factoid took 805 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 119 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2023-03-11 06:36:04] [INFO ] Invariant cache hit.
[2023-03-11 06:36:05] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-11 06:36:05] [INFO ] Invariant cache hit.
[2023-03-11 06:36:07] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
[2023-03-11 06:36:07] [INFO ] Invariant cache hit.
[2023-03-11 06:36:08] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3686 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 664 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:36:09] [INFO ] Invariant cache hit.
[2023-03-11 06:36:09] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:36:10] [INFO ] [Nat]Absence check using 147 positive place invariants in 75 ms returned sat
[2023-03-11 06:36:10] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:36:11] [INFO ] After 1065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:36:11] [INFO ] Deduced a trap composed of 281 places in 502 ms of which 1 ms to minimize.
[2023-03-11 06:36:12] [INFO ] Deduced a trap composed of 281 places in 374 ms of which 0 ms to minimize.
[2023-03-11 06:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1105 ms
[2023-03-11 06:36:13] [INFO ] Deduced a trap composed of 188 places in 519 ms of which 2 ms to minimize.
[2023-03-11 06:36:13] [INFO ] Deduced a trap composed of 194 places in 384 ms of which 1 ms to minimize.
[2023-03-11 06:36:13] [INFO ] Deduced a trap composed of 187 places in 370 ms of which 1 ms to minimize.
[2023-03-11 06:36:14] [INFO ] Deduced a trap composed of 197 places in 620 ms of which 1 ms to minimize.
[2023-03-11 06:36:15] [INFO ] Deduced a trap composed of 170 places in 431 ms of which 1 ms to minimize.
[2023-03-11 06:36:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2745 ms
[2023-03-11 06:36:15] [INFO ] After 5062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-11 06:36:15] [INFO ] After 5634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 882 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=126 )
Parikh walk visited 2 properties in 35 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 830 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 93 reset in 360 ms.
Product exploration explored 100000 steps with 93 reset in 394 ms.
Built C files in :
/tmp/ltsmin14783688524338270290
[2023-03-11 06:36:17] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14783688524338270290
Running compilation step : cd /tmp/ltsmin14783688524338270290;'/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 3025 ms.
Running link step : cd /tmp/ltsmin14783688524338270290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14783688524338270290;'/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/stateBased11660378162243649910.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 87 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2023-03-11 06:36:32] [INFO ] Invariant cache hit.
[2023-03-11 06:36:33] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-11 06:36:33] [INFO ] Invariant cache hit.
[2023-03-11 06:36:35] [INFO ] Implicit Places using invariants and state equation in 2063 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2023-03-11 06:36:35] [INFO ] Invariant cache hit.
[2023-03-11 06:36:36] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3782 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Built C files in :
/tmp/ltsmin13079041590442623504
[2023-03-11 06:36:36] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13079041590442623504
Running compilation step : cd /tmp/ltsmin13079041590442623504;'/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 2994 ms.
Running link step : cd /tmp/ltsmin13079041590442623504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13079041590442623504;'/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/stateBased9435394116503411128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:36:51] [INFO ] Flatten gal took : 50 ms
[2023-03-11 06:36:51] [INFO ] Flatten gal took : 45 ms
[2023-03-11 06:36:51] [INFO ] Time to serialize gal into /tmp/LTL8470733068235506408.gal : 10 ms
[2023-03-11 06:36:51] [INFO ] Time to serialize properties into /tmp/LTL11314152416968556131.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/LTL8470733068235506408.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9258704133257019745.hoa' '-atoms' '/tmp/LTL11314152416968556131.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/LTL11314152416968556131.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9258704133257019745.hoa
Detected timeout of ITS tools.
[2023-03-11 06:37:07] [INFO ] Flatten gal took : 83 ms
[2023-03-11 06:37:07] [INFO ] Flatten gal took : 67 ms
[2023-03-11 06:37:07] [INFO ] Time to serialize gal into /tmp/LTL11299879355182580218.gal : 7 ms
[2023-03-11 06:37:07] [INFO ] Time to serialize properties into /tmp/LTL18108750477947932007.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/LTL11299879355182580218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18108750477947932007.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p293==0)||(p96==1))")||(X("((p307==0)||(p258==1))"))))))
Formula 0 simplified : GF(!"((p293==0)||(p96==1))" & X!"((p307==0)||(p258==1))")
Detected timeout of ITS tools.
[2023-03-11 06:37:22] [INFO ] Flatten gal took : 46 ms
[2023-03-11 06:37:22] [INFO ] Applying decomposition
[2023-03-11 06:37:22] [INFO ] Flatten gal took : 42 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/graph13360805799696347262.txt' '-o' '/tmp/graph13360805799696347262.bin' '-w' '/tmp/graph13360805799696347262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13360805799696347262.bin' '-l' '-1' '-v' '-w' '/tmp/graph13360805799696347262.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:37:22] [INFO ] Decomposing Gal with order
[2023-03-11 06:37:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:37:22] [INFO ] Removed a total of 331 redundant transitions.
[2023-03-11 06:37:23] [INFO ] Flatten gal took : 128 ms
[2023-03-11 06:37:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-11 06:37:23] [INFO ] Time to serialize gal into /tmp/LTL2596544428023381428.gal : 25 ms
[2023-03-11 06:37:23] [INFO ] Time to serialize properties into /tmp/LTL15636522332559076395.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/LTL2596544428023381428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15636522332559076395.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i9.i0.i0.u97.p293==0)||(i14.u42.p96==1))")||(X("((i12.u100.p307==0)||(i2.i0.i0.u88.p258==1))"))))))
Formula 0 simplified : GF(!"((i9.i0.i0.u97.p293==0)||(i14.u42.p96==1))" & X!"((i12.u100.p307==0)||(i2.i0.i0.u88.p258==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17030100619265056466
[2023-03-11 06:37:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17030100619265056466
Running compilation step : cd /tmp/ltsmin17030100619265056466;'/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 2827 ms.
Running link step : cd /tmp/ltsmin17030100619265056466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin17030100619265056466;'/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((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 122117 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(G(p0)))'
Support contains 2 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1737 transition count 1688
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1737 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1728 transition count 1678
Applied a total of 47 rules in 304 ms. Remains 1728 /1751 variables (removed 23) and now considering 1678/1702 (removed 24) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-11 06:37:53] [INFO ] Computed 148 place invariants in 8 ms
[2023-03-11 06:37:54] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-11 06:37:54] [INFO ] Invariant cache hit.
[2023-03-11 06:37:56] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2551 ms to find 0 implicit places.
[2023-03-11 06:37:56] [INFO ] Invariant cache hit.
[2023-03-11 06:37:57] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1751 places, 1678/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3802 ms. Remains : 1728/1751 places, 1678/1702 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s337 0) (EQ s516 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 31783 steps with 29 reset in 113 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-03 finished in 4038 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(G(p0)))'
Support contains 2 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1736 transition count 1687
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1736 transition count 1687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1736 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1727 transition count 1677
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1725 transition count 1675
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1725 transition count 1675
Applied a total of 53 rules in 296 ms. Remains 1725 /1751 variables (removed 26) and now considering 1675/1702 (removed 27) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2023-03-11 06:37:57] [INFO ] Computed 148 place invariants in 6 ms
[2023-03-11 06:37:58] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 06:37:58] [INFO ] Invariant cache hit.
[2023-03-11 06:38:00] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 2793 ms to find 0 implicit places.
[2023-03-11 06:38:00] [INFO ] Invariant cache hit.
[2023-03-11 06:38:01] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1751 places, 1675/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4081 ms. Remains : 1725/1751 places, 1675/1702 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s956 0) (EQ s467 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-04 finished in 4200 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 2 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1736 transition count 1687
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1736 transition count 1687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1736 transition count 1686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1728 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1726 transition count 1676
Applied a total of 51 rules in 342 ms. Remains 1726 /1751 variables (removed 25) and now considering 1676/1702 (removed 26) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-11 06:38:01] [INFO ] Computed 148 place invariants in 17 ms
[2023-03-11 06:38:02] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-11 06:38:02] [INFO ] Invariant cache hit.
[2023-03-11 06:38:04] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
[2023-03-11 06:38:04] [INFO ] Invariant cache hit.
[2023-03-11 06:38:05] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1751 places, 1676/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3864 ms. Remains : 1726/1751 places, 1676/1702 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-10 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:(OR (EQ s371 0) (EQ s163 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 33333 reset in 753 ms.
Product exploration explored 100000 steps with 33333 reset in 805 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-10 finished in 5720 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((X(p0)||F(p1)))))'
Support contains 4 out of 1751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 1750 transition count 1068
Reduce places removed 633 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 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 707 rules applied. Total rules applied 1340 place count 1117 transition count 994
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1388 place count 1069 transition count 994
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 1388 place count 1069 transition count 798
Deduced a syphon composed of 196 places in 4 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 1780 place count 873 transition count 798
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1793 place count 860 transition count 785
Iterating global reduction 3 with 13 rules applied. Total rules applied 1806 place count 860 transition count 785
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1806 place count 860 transition count 777
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1822 place count 852 transition count 777
Performed 337 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 2496 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2497 place count 514 transition count 392
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 2569 place count 466 transition count 368
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2593 place count 442 transition count 368
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2593 place count 442 transition count 344
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 2641 place count 418 transition count 344
Applied a total of 2641 rules in 193 ms. Remains 418 /1751 variables (removed 1333) and now considering 344/1702 (removed 1358) transitions.
// Phase 1: matrix 344 rows 418 cols
[2023-03-11 06:38:07] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-11 06:38:07] [INFO ] Implicit Places using invariants in 321 ms returned [168, 243, 317, 321, 330, 334, 343, 347, 351, 355, 359, 363, 367, 371, 380, 384, 388, 392, 396, 400, 404, 408, 412, 417]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 324 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/1751 places, 344/1702 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 372 transition count 322
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 351 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 350 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 350 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 349 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 349 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 346 transition count 296
Applied a total of 96 rules in 122 ms. Remains 346 /394 variables (removed 48) and now considering 296/344 (removed 48) transitions.
// Phase 1: matrix 296 rows 346 cols
[2023-03-11 06:38:07] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-11 06:38:08] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-11 06:38:08] [INFO ] Invariant cache hit.
[2023-03-11 06:38:08] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1751 places, 296/1702 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1209 ms. Remains : 346/1751 places, 296/1702 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s191 0) (EQ s306 1)), p1:(AND (EQ s326 0) (EQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11517 steps with 143 reset in 105 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-11 finished in 1476 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((F((p0&&X(p0))) U !p1))))'
Support contains 4 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1737 transition count 1688
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1737 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1730 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1728 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1728 transition count 1678
Applied a total of 47 rules in 303 ms. Remains 1728 /1751 variables (removed 23) and now considering 1678/1702 (removed 24) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-11 06:38:09] [INFO ] Computed 148 place invariants in 40 ms
[2023-03-11 06:38:09] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-11 06:38:09] [INFO ] Invariant cache hit.
[2023-03-11 06:38:12] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 3137 ms to find 0 implicit places.
[2023-03-11 06:38:12] [INFO ] Invariant cache hit.
[2023-03-11 06:38:13] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1751 places, 1678/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4439 ms. Remains : 1728/1751 places, 1678/1702 transitions.
Stuttering acceptance computed with spot in 263 ms :[p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1385 0) (EQ s268 1)), p0:(OR (EQ s1457 0) (EQ s838 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28585 reset in 733 ms.
Product exploration explored 100000 steps with 28519 reset in 724 ms.
Computed a total of 416 stabilizing places and 416 stable transitions
Computed a total of 416 stabilizing places and 416 stable transitions
Detected a total of 416/1728 stabilizing places and 416/1678 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 611 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :4
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:38:15] [INFO ] Invariant cache hit.
[2023-03-11 06:38:16] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:38:16] [INFO ] [Nat]Absence check using 147 positive place invariants in 109 ms returned sat
[2023-03-11 06:38:16] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:38:17] [INFO ] After 832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:38:17] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 1 ms to minimize.
[2023-03-11 06:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2023-03-11 06:38:18] [INFO ] After 1518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-11 06:38:18] [INFO ] After 1973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions removed 622 transitions
Trivial Post-agglo rules discarded 622 transitions
Performed 622 trivial Post agglomeration. Transition count delta: 622
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 1728 transition count 1056
Reduce places removed 622 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 691 rules applied. Total rules applied 1313 place count 1106 transition count 987
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 1360 place count 1060 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1361 place count 1059 transition count 986
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1361 place count 1059 transition count 786
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1761 place count 859 transition count 786
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 4 with 680 rules applied. Total rules applied 2441 place count 519 transition count 398
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2443 place count 518 transition count 398
Free-agglomeration rule applied 96 times.
Iterating global reduction 4 with 96 rules applied. Total rules applied 2539 place count 518 transition count 302
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 2635 place count 422 transition count 302
Applied a total of 2635 rules in 106 ms. Remains 422 /1728 variables (removed 1306) and now considering 302/1678 (removed 1376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 422/1728 places, 302/1678 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished Best-First random walk after 311 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 925 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 323 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 370 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
[2023-03-11 06:38:19] [INFO ] Invariant cache hit.
[2023-03-11 06:38:20] [INFO ] [Real]Absence check using 147 positive place invariants in 110 ms returned sat
[2023-03-11 06:38:20] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 06:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:31] [INFO ] [Real]Absence check using state equation in 10902 ms returned sat
[2023-03-11 06:38:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:38:32] [INFO ] [Nat]Absence check using 147 positive place invariants in 101 ms returned sat
[2023-03-11 06:38:32] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 06:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:37] [INFO ] [Nat]Absence check using state equation in 5320 ms returned sat
[2023-03-11 06:38:38] [INFO ] Computed and/alt/rep : 1675/2331/1675 causal constraints (skipped 2 transitions) in 121 ms.
[2023-03-11 06:38:47] [INFO ] Deduced a trap composed of 8 places in 1038 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: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:38:47] [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 p1
Could not prove EG p1
Support contains 4 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 621 transitions
Trivial Post-agglo rules discarded 621 transitions
Performed 621 trivial Post agglomeration. Transition count delta: 621
Iterating post reduction 0 with 621 rules applied. Total rules applied 621 place count 1727 transition count 1056
Reduce places removed 621 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 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 690 rules applied. Total rules applied 1311 place count 1106 transition count 987
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 1358 place count 1060 transition count 986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1359 place count 1059 transition count 986
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1359 place count 1059 transition count 786
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1759 place count 859 transition count 786
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 4 with 680 rules applied. Total rules applied 2439 place count 519 transition count 398
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2441 place count 518 transition count 398
Applied a total of 2441 rules in 143 ms. Remains 518 /1728 variables (removed 1210) and now considering 398/1678 (removed 1280) transitions.
// Phase 1: matrix 398 rows 518 cols
[2023-03-11 06:38:48] [INFO ] Computed 148 place invariants in 3 ms
[2023-03-11 06:38:48] [INFO ] Implicit Places using invariants in 514 ms returned [171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 295, 369, 375, 389, 395, 401, 407, 413, 420, 426, 432, 438, 444, 450, 456, 462, 468, 474, 480, 486, 492, 498, 504, 510, 517]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 517 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 445/1728 places, 398/1678 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 445 transition count 351
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 398 transition count 351
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 118 place count 374 transition count 327
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 374 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 373 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 373 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 372 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 372 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 371 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 371 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 370 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 370 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 369 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 369 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 368 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 367 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 366 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 365 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 364 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 363 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 362 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 361 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 360 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 359 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 358 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 357 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 356 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 355 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 354 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 353 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 352 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 351 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 350 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 350 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 194 place count 348 transition count 301
Applied a total of 194 rules in 249 ms. Remains 348 /445 variables (removed 97) and now considering 301/398 (removed 97) transitions.
// Phase 1: matrix 301 rows 348 cols
[2023-03-11 06:38:48] [INFO ] Computed 75 place invariants in 3 ms
[2023-03-11 06:38:49] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 06:38:49] [INFO ] Invariant cache hit.
[2023-03-11 06:38:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-11 06:38:49] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 348/1728 places, 301/1678 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1769 ms. Remains : 348/1728 places, 301/1678 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/348 stabilizing places and 6/301 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 885 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 421 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Finished random walk after 6278 steps, including 72 resets, run visited all 5 properties in 67 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 1178 ms. Reduced automaton from 6 states, 19 edges and 2 AP (stutter insensitive) to 6 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 422 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 405 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
[2023-03-11 06:38:53] [INFO ] Invariant cache hit.
[2023-03-11 06:38:53] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-11 06:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:53] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-11 06:38:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:38:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-11 06:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:38:54] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-11 06:38:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-11 06:38:54] [INFO ] [Nat]Added 73 Read/Feed constraints in 44 ms returned sat
[2023-03-11 06:38:54] [INFO ] Computed and/alt/rep : 273/856/273 causal constraints (skipped 26 transitions) in 45 ms.
[2023-03-11 06:38:55] [INFO ] Added : 137 causal constraints over 28 iterations in 1285 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 410 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering criterion allowed to conclude after 28913 steps with 8080 reset in 235 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-12 finished in 47567 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(p1)||p0))&&(G(p2)||X(G(p3)))))'
Support contains 6 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1739 transition count 1690
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1739 transition count 1690
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1739 transition count 1689
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 1734 transition count 1684
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 1734 transition count 1684
Applied a total of 35 rules in 684 ms. Remains 1734 /1751 variables (removed 17) and now considering 1684/1702 (removed 18) transitions.
// Phase 1: matrix 1684 rows 1734 cols
[2023-03-11 06:38:56] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-11 06:38:57] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-11 06:38:57] [INFO ] Invariant cache hit.
[2023-03-11 06:39:00] [INFO ] Implicit Places using invariants and state equation in 3266 ms returned []
Implicit Place search using SMT with State Equation took 3920 ms to find 0 implicit places.
[2023-03-11 06:39:00] [INFO ] Invariant cache hit.
[2023-03-11 06:39:01] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1734/1751 places, 1684/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5640 ms. Remains : 1734/1751 places, 1684/1702 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s621 0) (EQ s141 1)), p0:(OR (EQ s268 0) (EQ s192 1)), p3:(AND (EQ s192 0) (EQ s268 1)), p1:(OR (EQ s1280 0) (EQ s560 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 571 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 5970 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(G(p0)))'
Support contains 2 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1751/1751 places, 1702/1702 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1737 transition count 1688
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1737 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1737 transition count 1687
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1728 transition count 1678
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1726 transition count 1676
Applied a total of 51 rules in 397 ms. Remains 1726 /1751 variables (removed 25) and now considering 1676/1702 (removed 26) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-11 06:39:02] [INFO ] Computed 148 place invariants in 14 ms
[2023-03-11 06:39:03] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-11 06:39:03] [INFO ] Invariant cache hit.
[2023-03-11 06:39:05] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
[2023-03-11 06:39:05] [INFO ] Invariant cache hit.
[2023-03-11 06:39:06] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1751 places, 1676/1702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3950 ms. Remains : 1726/1751 places, 1676/1702 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s501 0) (EQ s280 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 93 reset in 431 ms.
Entered a terminal (fully accepting) state of product in 3983 steps with 3 reset in 19 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 4550 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((X(p1)||p0))))'
Found a Lengthening insensitive property : AutoFlight-PT-24b-LTLCardinality-01
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1751 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1751/1751 places, 1702/1702 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 1750 transition count 1070
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 705 rules applied. Total rules applied 1336 place count 1119 transition count 996
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 1385 place count 1071 transition count 995
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1386 place count 1070 transition count 995
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1386 place count 1070 transition count 796
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1784 place count 871 transition count 796
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1797 place count 858 transition count 783
Iterating global reduction 4 with 13 rules applied. Total rules applied 1810 place count 858 transition count 783
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1810 place count 858 transition count 775
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1826 place count 850 transition count 775
Performed 334 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 4 with 668 rules applied. Total rules applied 2494 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 4 with 1 rules applied. Total rules applied 2495 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 4 with 72 rules applied. Total rules applied 2567 place count 467 transition count 369
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2591 place count 443 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2591 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 6 with 48 rules applied. Total rules applied 2639 place count 419 transition count 345
Applied a total of 2639 rules in 186 ms. Remains 419 /1751 variables (removed 1332) and now considering 345/1702 (removed 1357) transitions.
// Phase 1: matrix 345 rows 419 cols
[2023-03-11 06:39:07] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-11 06:39:07] [INFO ] Implicit Places using invariants in 254 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 255 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/1751 places, 345/1702 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 363 transition count 316
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 60 place count 362 transition count 315
Applied a total of 60 rules in 24 ms. Remains 362 /392 variables (removed 30) and now considering 315/345 (removed 30) transitions.
// Phase 1: matrix 315 rows 362 cols
[2023-03-11 06:39:07] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-11 06:39:07] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-11 06:39:07] [INFO ] Invariant cache hit.
[2023-03-11 06:39:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:39:08] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 362/1751 places, 315/1702 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1432 ms. Remains : 362/1751 places, 315/1702 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s1 1)), p1:(OR (EQ s38 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1191 reset in 389 ms.
Product exploration explored 100000 steps with 1205 reset in 316 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 735 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:10] [INFO ] Invariant cache hit.
[2023-03-11 06:39:10] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:10] [INFO ] [Nat]Absence check using 73 positive place invariants in 11 ms returned sat
[2023-03-11 06:39:10] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:39:10] [INFO ] After 32ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:10] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 06:39:10] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t263.t372 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 3 ms
Free SCC test removed 13 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 23 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 93/362 places, 75/315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Finished Best-First random walk after 502 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 11 factoid took 680 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2023-03-11 06:39:11] [INFO ] Invariant cache hit.
[2023-03-11 06:39:11] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-11 06:39:11] [INFO ] Invariant cache hit.
[2023-03-11 06:39:12] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:39:12] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
[2023-03-11 06:39:12] [INFO ] Invariant cache hit.
[2023-03-11 06:39:12] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1271 ms. Remains : 362/362 places, 315/315 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 703 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:39:13] [INFO ] Invariant cache hit.
[2023-03-11 06:39:14] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:39:14] [INFO ] [Nat]Absence check using 73 positive place invariants in 82 ms returned sat
[2023-03-11 06:39:14] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:39:14] [INFO ] After 70ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:39:14] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-11 06:39:14] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t263.t372 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 11 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 93/362 places, 75/315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Finished Best-First random walk after 97 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 695 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1205 reset in 316 ms.
Product exploration explored 100000 steps with 1199 reset in 384 ms.
Built C files in :
/tmp/ltsmin10223502258768406886
[2023-03-11 06:39:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10223502258768406886
Running compilation step : cd /tmp/ltsmin10223502258768406886;'/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 479 ms.
Running link step : cd /tmp/ltsmin10223502258768406886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10223502258768406886;'/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/stateBased14637760296857140287.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2023-03-11 06:39:31] [INFO ] Invariant cache hit.
[2023-03-11 06:39:32] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-11 06:39:32] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-03-11 06:39:32] [INFO ] Invariant cache hit.
[2023-03-11 06:39:33] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1327 ms. Remains : 362/362 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin9976012984097328818
[2023-03-11 06:39:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9976012984097328818
Running compilation step : cd /tmp/ltsmin9976012984097328818;'/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 574 ms.
Running link step : cd /tmp/ltsmin9976012984097328818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9976012984097328818;'/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/stateBased18089659740306743947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 06:39:48] [INFO ] Flatten gal took : 21 ms
[2023-03-11 06:39:48] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:39:48] [INFO ] Time to serialize gal into /tmp/LTL7101586132935230883.gal : 2 ms
[2023-03-11 06:39:48] [INFO ] Time to serialize properties into /tmp/LTL13410347266813753541.prop : 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/LTL7101586132935230883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5793287972317004844.hoa' '-atoms' '/tmp/LTL13410347266813753541.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/LTL13410347266813753541.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5793287972317004844.hoa
Detected timeout of ITS tools.
[2023-03-11 06:40:03] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:40:03] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:40:03] [INFO ] Time to serialize gal into /tmp/LTL16030150395661634143.gal : 2 ms
[2023-03-11 06:40:03] [INFO ] Time to serialize properties into /tmp/LTL5460506961765683253.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/LTL16030150395661634143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5460506961765683253.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p293==0)||(p96==1))")||(X("((p307==0)||(p258==1))"))))))
Formula 0 simplified : GF(!"((p293==0)||(p96==1))" & X!"((p307==0)||(p258==1))")
Detected timeout of ITS tools.
[2023-03-11 06:40:18] [INFO ] Flatten gal took : 39 ms
[2023-03-11 06:40:18] [INFO ] Applying decomposition
[2023-03-11 06:40:18] [INFO ] Flatten gal took : 28 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/graph14454356369673042670.txt' '-o' '/tmp/graph14454356369673042670.bin' '-w' '/tmp/graph14454356369673042670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14454356369673042670.bin' '-l' '-1' '-v' '-w' '/tmp/graph14454356369673042670.weights' '-q' '0' '-e' '0.001'
[2023-03-11 06:40:18] [INFO ] Decomposing Gal with order
[2023-03-11 06:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 06:40:18] [INFO ] Removed a total of 19 redundant transitions.
[2023-03-11 06:40:18] [INFO ] Flatten gal took : 37 ms
[2023-03-11 06:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-11 06:40:18] [INFO ] Time to serialize gal into /tmp/LTL3989481438559748506.gal : 4 ms
[2023-03-11 06:40:18] [INFO ] Time to serialize properties into /tmp/LTL16263570948502177175.ltl : 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/LTL3989481438559748506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16263570948502177175.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...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i6.i1.u14.p293==0)||(i1.i1.u0.p96==1))")||(X("((i13.i1.u15.p307==0)||(i6.i1.u11.p258==1))"))))))
Formula 0 simplified : GF(!"((i6.i1.u14.p293==0)||(i1.i1.u0.p96==1))" & X!"((i13.i1.u15.p307==0)||(i6.i1.u11.p258==1))")
Reverse transition relation is NOT exact ! Due to transitions t254, i1.i1.t255, i13.i1.u15.t228, Intersection with reachable at each step enabled. (destro...196
Computing Next relation with stutter on 1.94616e+09 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
50 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.546444,39308,1,0,34388,27688,4418,59550,1272,101827,61269
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 72673 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 06:40:19] [INFO ] Flatten gal took : 63 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 298071 ms.

BK_STOP 1678516820373

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-24b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593200491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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