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.r007-oct2-167813595600491.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 lolaxred
Input is AutoFlight-PT-24b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595600491
=====================================================================

--------------------
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 1678349853728

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:17:35] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-09 08:17:35] [INFO ] Transformed 2230 places.
[2023-03-09 08:17:36] [INFO ] Transformed 2228 transitions.
[2023-03-09 08:17:36] [INFO ] Found NUPN structural information;
[2023-03-09 08:17:36] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 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 845 ms. Remains 1751 /2230 variables (removed 479) and now considering 1702/2228 (removed 526) transitions.
// Phase 1: matrix 1702 rows 1751 cols
[2023-03-09 08:17:37] [INFO ] Computed 148 place invariants in 32 ms
[2023-03-09 08:17:37] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-09 08:17:37] [INFO ] Invariant cache hit.
[2023-03-09 08:17:40] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 3198 ms to find 0 implicit places.
[2023-03-09 08:17:40] [INFO ] Invariant cache hit.
[2023-03-09 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 884 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 4941 ms. Remains : 1751/2230 places, 1702/2228 transitions.
Support contains 28 out of 1751 places after structural reductions.
[2023-03-09 08:17:41] [INFO ] Flatten gal took : 123 ms
[2023-03-09 08:17:41] [INFO ] Flatten gal took : 56 ms
[2023-03-09 08:17:41] [INFO ] Input system was already deterministic with 1702 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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
Running SMT prover for 7 properties.
[2023-03-09 08:17:42] [INFO ] Invariant cache hit.
[2023-03-09 08:17:42] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 08:17:43] [INFO ] [Nat]Absence check using 147 positive place invariants in 105 ms returned sat
[2023-03-09 08:17:43] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:17:45] [INFO ] After 1473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 08:17:45] [INFO ] Deduced a trap composed of 124 places in 488 ms of which 8 ms to minimize.
[2023-03-09 08:17:46] [INFO ] Deduced a trap composed of 108 places in 409 ms of which 1 ms to minimize.
[2023-03-09 08:17:46] [INFO ] Deduced a trap composed of 158 places in 502 ms of which 28 ms to minimize.
[2023-03-09 08:17:47] [INFO ] Deduced a trap composed of 136 places in 344 ms of which 1 ms to minimize.
[2023-03-09 08:17:47] [INFO ] Deduced a trap composed of 77 places in 375 ms of which 2 ms to minimize.
[2023-03-09 08:17:48] [INFO ] Deduced a trap composed of 167 places in 462 ms of which 1 ms to minimize.
[2023-03-09 08:17:48] [INFO ] Deduced a trap composed of 128 places in 360 ms of which 1 ms to minimize.
[2023-03-09 08:17:49] [INFO ] Deduced a trap composed of 165 places in 331 ms of which 1 ms to minimize.
[2023-03-09 08:17:49] [INFO ] Deduced a trap composed of 152 places in 510 ms of which 1 ms to minimize.
[2023-03-09 08:17:50] [INFO ] Deduced a trap composed of 147 places in 399 ms of which 1 ms to minimize.
[2023-03-09 08:17:50] [INFO ] Deduced a trap composed of 170 places in 359 ms of which 1 ms to minimize.
[2023-03-09 08:17:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5474 ms
[2023-03-09 08:17:50] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2023-03-09 08:17:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-09 08:17:51] [INFO ] Deduced a trap composed of 55 places in 273 ms of which 0 ms to minimize.
[2023-03-09 08:17:51] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 0 ms to minimize.
[2023-03-09 08:17:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 653 ms
[2023-03-09 08:17:52] [INFO ] Deduced a trap composed of 210 places in 407 ms of which 1 ms to minimize.
[2023-03-09 08:17:52] [INFO ] Deduced a trap composed of 247 places in 374 ms of which 1 ms to minimize.
[2023-03-09 08:17:53] [INFO ] Deduced a trap composed of 120 places in 415 ms of which 1 ms to minimize.
[2023-03-09 08:17:53] [INFO ] Deduced a trap composed of 123 places in 412 ms of which 1 ms to minimize.
[2023-03-09 08:17:54] [INFO ] Deduced a trap composed of 131 places in 246 ms of which 6 ms to minimize.
[2023-03-09 08:17:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2240 ms
[2023-03-09 08:17:54] [INFO ] After 10869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 521 ms.
[2023-03-09 08:17:55] [INFO ] After 12075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 5 properties in 229 ms.
Support contains 4 out of 1751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1751/1751 places, 1702/1702 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 1751 transition count 1071
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 1120 transition count 997
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 1072 transition count 996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1386 place count 1071 transition count 996
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 1071 transition count 797
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1784 place count 872 transition count 797
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1796 place count 860 transition count 785
Iterating global reduction 4 with 12 rules applied. Total rules applied 1808 place count 860 transition count 785
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1808 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 4 with 16 rules applied. Total rules applied 1824 place count 852 transition count 777
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 2496 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 94 times.
Iterating global reduction 4 with 94 rules applied. Total rules applied 2590 place count 516 transition count 300
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 4 with 94 rules applied. Total rules applied 2684 place count 422 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2685 place count 421 transition count 299
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 5 with 302 rules applied. Total rules applied 2987 place count 305 transition count 113
Reduce places removed 186 places and 0 transitions.
Iterating post reduction 6 with 186 rules applied. Total rules applied 3173 place count 119 transition count 113
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 3173 place count 119 transition count 73
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 3253 place count 79 transition count 73
Applied a total of 3253 rules in 406 ms. Remains 79 /1751 variables (removed 1672) and now considering 73/1702 (removed 1629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 79/1751 places, 73/1702 transitions.
Finished random walk after 234 steps, including 11 resets, run visited all 2 properties in 5 ms. (steps per millisecond=46 )
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 435 ms. Remains 1726 /1751 variables (removed 25) and now considering 1677/1702 (removed 25) transitions.
// Phase 1: matrix 1677 rows 1726 cols
[2023-03-09 08:17:56] [INFO ] Computed 148 place invariants in 43 ms
[2023-03-09 08:17:56] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-03-09 08:17:56] [INFO ] Invariant cache hit.
[2023-03-09 08:17:59] [INFO ] Implicit Places using invariants and state equation in 2264 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
[2023-03-09 08:17:59] [INFO ] Invariant cache hit.
[2023-03-09 08:18:00] [INFO ] Dead Transitions using invariants and state equation in 845 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 4146 ms. Remains : 1726/1751 places, 1677/1702 transitions.
Stuttering acceptance computed with spot in 294 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 1750 steps with 1 reset in 14 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-00 finished in 4545 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 315 ms. Remains 1725 /1751 variables (removed 26) and now considering 1675/1702 (removed 27) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2023-03-09 08:18:00] [INFO ] Computed 148 place invariants in 42 ms
[2023-03-09 08:18:01] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-09 08:18:01] [INFO ] Invariant cache hit.
[2023-03-09 08:18:03] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 2763 ms to find 0 implicit places.
[2023-03-09 08:18:03] [INFO ] Invariant cache hit.
[2023-03-09 08:18:04] [INFO ] Dead Transitions using invariants and state equation in 833 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 3925 ms. Remains : 1725/1751 places, 1675/1702 transitions.
Stuttering acceptance computed with spot in 71 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 338 ms.
Product exploration explored 100000 steps with 94 reset in 459 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 468 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:18:05] [INFO ] Invariant cache hit.
[2023-03-09 08:18:06] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:18:06] [INFO ] [Nat]Absence check using 147 positive place invariants in 90 ms returned sat
[2023-03-09 08:18:06] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-09 08:18:07] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:18:07] [INFO ] Deduced a trap composed of 129 places in 430 ms of which 1 ms to minimize.
[2023-03-09 08:18:08] [INFO ] Deduced a trap composed of 131 places in 391 ms of which 3 ms to minimize.
[2023-03-09 08:18:08] [INFO ] Deduced a trap composed of 190 places in 362 ms of which 1 ms to minimize.
[2023-03-09 08:18:09] [INFO ] Deduced a trap composed of 157 places in 352 ms of which 1 ms to minimize.
[2023-03-09 08:18:09] [INFO ] Deduced a trap composed of 170 places in 354 ms of which 1 ms to minimize.
[2023-03-09 08:18:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2239 ms
[2023-03-09 08:18:10] [INFO ] Deduced a trap composed of 136 places in 312 ms of which 4 ms to minimize.
[2023-03-09 08:18:10] [INFO ] Deduced a trap composed of 281 places in 353 ms of which 1 ms to minimize.
[2023-03-09 08:18:10] [INFO ] Deduced a trap composed of 214 places in 288 ms of which 2 ms to minimize.
[2023-03-09 08:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1213 ms
[2023-03-09 08:18:11] [INFO ] After 4430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-09 08:18:11] [INFO ] After 4922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 66 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 2 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 134 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 134 ms. Remains : 162/1725 places, 132/1675 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished Best-First random walk after 661 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=330 )
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 595 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 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 77 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2023-03-09 08:18:12] [INFO ] Invariant cache hit.
[2023-03-09 08:18:12] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 08:18:12] [INFO ] Invariant cache hit.
[2023-03-09 08:18:14] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-09 08:18:14] [INFO ] Invariant cache hit.
[2023-03-09 08:18:15] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3074 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 338 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 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:18:15] [INFO ] Invariant cache hit.
[2023-03-09 08:18:16] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:18:16] [INFO ] [Nat]Absence check using 147 positive place invariants in 76 ms returned sat
[2023-03-09 08:18:16] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-09 08:18:17] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:18:17] [INFO ] Deduced a trap composed of 281 places in 447 ms of which 1 ms to minimize.
[2023-03-09 08:18:17] [INFO ] Deduced a trap composed of 281 places in 318 ms of which 1 ms to minimize.
[2023-03-09 08:18:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 969 ms
[2023-03-09 08:18:18] [INFO ] Deduced a trap composed of 188 places in 357 ms of which 1 ms to minimize.
[2023-03-09 08:18:18] [INFO ] Deduced a trap composed of 194 places in 362 ms of which 1 ms to minimize.
[2023-03-09 08:18:19] [INFO ] Deduced a trap composed of 187 places in 364 ms of which 1 ms to minimize.
[2023-03-09 08:18:19] [INFO ] Deduced a trap composed of 197 places in 359 ms of which 1 ms to minimize.
[2023-03-09 08:18:20] [INFO ] Deduced a trap composed of 170 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:18:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2132 ms
[2023-03-09 08:18:20] [INFO ] After 3978ms 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-09 08:18:20] [INFO ] After 4444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 887 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=147 )
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 619 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 93 reset in 428 ms.
Product exploration explored 100000 steps with 94 reset in 393 ms.
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 93 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2023-03-09 08:18:22] [INFO ] Invariant cache hit.
[2023-03-09 08:18:22] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-09 08:18:22] [INFO ] Invariant cache hit.
[2023-03-09 08:18:24] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2023-03-09 08:18:24] [INFO ] Invariant cache hit.
[2023-03-09 08:18:25] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3448 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 25510 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 348 ms. Remains 1728 /1751 variables (removed 23) and now considering 1678/1702 (removed 24) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-09 08:18:26] [INFO ] Computed 148 place invariants in 17 ms
[2023-03-09 08:18:26] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-09 08:18:26] [INFO ] Invariant cache hit.
[2023-03-09 08:18:28] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-09 08:18:28] [INFO ] Invariant cache hit.
[2023-03-09 08:18:29] [INFO ] Dead Transitions using invariants and state equation in 876 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 3578 ms. Remains : 1728/1751 places, 1678/1702 transitions.
Stuttering acceptance computed with spot in 79 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 21071 steps with 19 reset in 69 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-03 finished in 3745 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 313 ms. Remains 1725 /1751 variables (removed 26) and now considering 1675/1702 (removed 27) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2023-03-09 08:18:30] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-09 08:18:30] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-09 08:18:30] [INFO ] Invariant cache hit.
[2023-03-09 08:18:32] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
[2023-03-09 08:18:32] [INFO ] Invariant cache hit.
[2023-03-09 08:18:33] [INFO ] Dead Transitions using invariants and state equation in 842 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 3699 ms. Remains : 1725/1751 places, 1675/1702 transitions.
Stuttering acceptance computed with spot in 61 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 17 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-04 finished in 3782 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 318 ms. Remains 1726 /1751 variables (removed 25) and now considering 1676/1702 (removed 26) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-09 08:18:33] [INFO ] Computed 148 place invariants in 22 ms
[2023-03-09 08:18:34] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-09 08:18:34] [INFO ] Invariant cache hit.
[2023-03-09 08:18:36] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2023-03-09 08:18:36] [INFO ] Invariant cache hit.
[2023-03-09 08:18:37] [INFO ] Dead Transitions using invariants and state equation in 891 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 3619 ms. Remains : 1726/1751 places, 1676/1702 transitions.
Stuttering acceptance computed with spot in 77 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 768 ms.
Product exploration explored 100000 steps with 33333 reset in 720 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 107 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 5351 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 3 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 0 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 188 ms. Remains 418 /1751 variables (removed 1333) and now considering 344/1702 (removed 1358) transitions.
// Phase 1: matrix 344 rows 418 cols
[2023-03-09 08:18:39] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-09 08:18:39] [INFO ] Implicit Places using invariants in 207 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 221 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 100 ms. Remains 346 /394 variables (removed 48) and now considering 296/344 (removed 48) transitions.
// Phase 1: matrix 296 rows 346 cols
[2023-03-09 08:18:39] [INFO ] Computed 76 place invariants in 1 ms
[2023-03-09 08:18:39] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-09 08:18:39] [INFO ] Invariant cache hit.
[2023-03-09 08:18:39] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 664 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 1173 ms. Remains : 346/1751 places, 296/1702 transitions.
Stuttering acceptance computed with spot in 105 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 2316 steps with 28 reset in 26 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-11 finished in 1329 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 331 ms. Remains 1728 /1751 variables (removed 23) and now considering 1678/1702 (removed 24) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2023-03-09 08:18:40] [INFO ] Computed 148 place invariants in 16 ms
[2023-03-09 08:18:40] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-09 08:18:40] [INFO ] Invariant cache hit.
[2023-03-09 08:18:42] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2023-03-09 08:18:42] [INFO ] Invariant cache hit.
[2023-03-09 08:18:43] [INFO ] Dead Transitions using invariants and state equation in 797 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 3413 ms. Remains : 1728/1751 places, 1678/1702 transitions.
Stuttering acceptance computed with spot in 175 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 28641 reset in 712 ms.
Product exploration explored 100000 steps with 28485 reset in 738 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 693 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 249 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 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :3
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
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-09 08:18:46] [INFO ] Invariant cache hit.
[2023-03-09 08:18:46] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:18:46] [INFO ] [Nat]Absence check using 147 positive place invariants in 73 ms returned sat
[2023-03-09 08:18:46] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-09 08:18:47] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:18:48] [INFO ] After 1194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-09 08:18:48] [INFO ] After 1814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 353 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=70 )
Parikh walk visited 2 properties in 5 ms.
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 774 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 282 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 347 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
[2023-03-09 08:18:49] [INFO ] Invariant cache hit.
[2023-03-09 08:18:50] [INFO ] [Real]Absence check using 147 positive place invariants in 142 ms returned sat
[2023-03-09 08:18:50] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-09 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:19:01] [INFO ] [Real]Absence check using state equation in 10743 ms returned sat
[2023-03-09 08:19:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:19:02] [INFO ] [Nat]Absence check using 147 positive place invariants in 97 ms returned sat
[2023-03-09 08:19:02] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-09 08:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:19:07] [INFO ] [Nat]Absence check using state equation in 5342 ms returned sat
[2023-03-09 08:19:07] [INFO ] Computed and/alt/rep : 1675/2331/1675 causal constraints (skipped 2 transitions) in 119 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:19:16] [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: Broken pipe ... 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 3 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 0 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 138 ms. Remains 518 /1728 variables (removed 1210) and now considering 398/1678 (removed 1280) transitions.
// Phase 1: matrix 398 rows 518 cols
[2023-03-09 08:19:16] [INFO ] Computed 148 place invariants in 2 ms
[2023-03-09 08:19:17] [INFO ] Implicit Places using invariants in 519 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 532 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 140 ms. Remains 348 /445 variables (removed 97) and now considering 301/398 (removed 97) transitions.
// Phase 1: matrix 301 rows 348 cols
[2023-03-09 08:19:17] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-09 08:19:17] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 08:19:17] [INFO ] Invariant cache hit.
[2023-03-09 08:19:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:19:18] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 884 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 1696 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 669 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 268 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Finished random walk after 9990 steps, including 116 resets, run visited all 5 properties in 96 ms. (steps per millisecond=104 )
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 927 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 308 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering acceptance computed with spot in 413 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
[2023-03-09 08:19:20] [INFO ] Invariant cache hit.
[2023-03-09 08:19:21] [INFO ] [Real]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-09 08:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:19:21] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-09 08:19:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:19:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 33 ms returned sat
[2023-03-09 08:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:19:22] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-09 08:19:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 08:19:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 12 ms returned sat
[2023-03-09 08:19:22] [INFO ] Computed and/alt/rep : 273/856/273 causal constraints (skipped 26 transitions) in 30 ms.
[2023-03-09 08:19:23] [INFO ] Added : 137 causal constraints over 28 iterations in 1144 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 414 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), false, false]
Stuttering criterion allowed to conclude after 80382 steps with 22789 reset in 621 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-12 finished in 44140 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 252 ms. Remains 1734 /1751 variables (removed 17) and now considering 1684/1702 (removed 18) transitions.
// Phase 1: matrix 1684 rows 1734 cols
[2023-03-09 08:19:24] [INFO ] Computed 148 place invariants in 13 ms
[2023-03-09 08:19:25] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-09 08:19:25] [INFO ] Invariant cache hit.
[2023-03-09 08:19:26] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2023-03-09 08:19:26] [INFO ] Invariant cache hit.
[2023-03-09 08:19:27] [INFO ] Dead Transitions using invariants and state equation in 810 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 3484 ms. Remains : 1734/1751 places, 1684/1702 transitions.
Stuttering acceptance computed with spot in 207 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 572 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 3744 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 415 ms. Remains 1726 /1751 variables (removed 25) and now considering 1676/1702 (removed 26) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2023-03-09 08:19:28] [INFO ] Computed 148 place invariants in 5 ms
[2023-03-09 08:19:28] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-09 08:19:28] [INFO ] Invariant cache hit.
[2023-03-09 08:19:30] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2023-03-09 08:19:30] [INFO ] Invariant cache hit.
[2023-03-09 08:19:31] [INFO ] Dead Transitions using invariants and state equation in 804 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 3502 ms. Remains : 1726/1751 places, 1676/1702 transitions.
Stuttering acceptance computed with spot in 82 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]]
Entered a terminal (fully accepting) state of product in 817 steps with 0 reset in 4 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 3615 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 82 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 3 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 2 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 1 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 112 ms. Remains 419 /1751 variables (removed 1332) and now considering 345/1702 (removed 1357) transitions.
// Phase 1: matrix 345 rows 419 cols
[2023-03-09 08:19:31] [INFO ] Computed 100 place invariants in 7 ms
[2023-03-09 08:19:32] [INFO ] Implicit Places using invariants in 202 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 205 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 39 ms. Remains 362 /392 variables (removed 30) and now considering 315/345 (removed 30) transitions.
// Phase 1: matrix 315 rows 362 cols
[2023-03-09 08:19:32] [INFO ] Computed 73 place invariants in 1 ms
[2023-03-09 08:19:32] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 08:19:32] [INFO ] Invariant cache hit.
[2023-03-09 08:19:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 08:19:32] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 823 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 1179 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 1197 reset in 340 ms.
Product exploration explored 100000 steps with 1203 reset in 331 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 468 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 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:19:34] [INFO ] Invariant cache hit.
[2023-03-09 08:19:34] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:19:34] [INFO ] [Nat]Absence check using 73 positive place invariants in 12 ms returned sat
[2023-03-09 08:19:34] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:19:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 08:19:34] [INFO ] After 43ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:19:34] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 08:19:34] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 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 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 651 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=325 )
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 764 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 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 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 7 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2023-03-09 08:19:35] [INFO ] Invariant cache hit.
[2023-03-09 08:19:36] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-09 08:19:36] [INFO ] Invariant cache hit.
[2023-03-09 08:19:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 08:19:37] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-09 08:19:37] [INFO ] Invariant cache hit.
[2023-03-09 08:19:37] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1393 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 527 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 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:19:38] [INFO ] Invariant cache hit.
[2023-03-09 08:19:38] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:19:38] [INFO ] [Nat]Absence check using 73 positive place invariants in 9 ms returned sat
[2023-03-09 08:19:38] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:19:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 08:19:38] [INFO ] After 39ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 08:19:38] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-09 08:19:38] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 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 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 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Finished Best-First random walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
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 740 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1202 reset in 365 ms.
Product exploration explored 100000 steps with 1209 reset in 329 ms.
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 2 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2023-03-09 08:19:40] [INFO ] Invariant cache hit.
[2023-03-09 08:19:40] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-09 08:19:40] [INFO ] Invariant cache hit.
[2023-03-09 08:19:41] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 08:19:41] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2023-03-09 08:19:41] [INFO ] Invariant cache hit.
[2023-03-09 08:19:41] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 362/362 places, 315/315 transitions.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 10324 ms.
[2023-03-09 08:19:42] [INFO ] Flatten gal took : 54 ms
[2023-03-09 08:19:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 08:19:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1751 places, 1702 transitions and 4134 arcs took 9 ms.
Total runtime 126256 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-24b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLCardinality

BK_STOP 1678350067645

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-24b-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 AutoFlight-PT-24b-LTLCardinality-01 99270 m, 19854 m/sec, 490122 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 5/32 AutoFlight-PT-24b-LTLCardinality-01 200918 m, 20329 m/sec, 1021771 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 7/32 AutoFlight-PT-24b-LTLCardinality-01 286611 m, 17138 m/sec, 1553285 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 9/32 AutoFlight-PT-24b-LTLCardinality-01 376142 m, 17906 m/sec, 2086884 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 11/32 AutoFlight-PT-24b-LTLCardinality-01 462039 m, 17179 m/sec, 2619609 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 13/32 AutoFlight-PT-24b-LTLCardinality-01 551505 m, 17893 m/sec, 3152868 t fired, .

Time elapsed: 30 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 14/32 AutoFlight-PT-24b-LTLCardinality-01 637338 m, 17166 m/sec, 3685119 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 16/32 AutoFlight-PT-24b-LTLCardinality-01 726965 m, 17925 m/sec, 4219290 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 18/32 AutoFlight-PT-24b-LTLCardinality-01 813037 m, 17214 m/sec, 4753409 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 20/32 AutoFlight-PT-24b-LTLCardinality-01 902866 m, 17965 m/sec, 5288502 t fired, .

Time elapsed: 50 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 22/32 AutoFlight-PT-24b-LTLCardinality-01 989023 m, 17231 m/sec, 5823454 t fired, .

Time elapsed: 55 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 24/32 AutoFlight-PT-24b-LTLCardinality-01 1078692 m, 17933 m/sec, 6357500 t fired, .

Time elapsed: 60 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 26/32 AutoFlight-PT-24b-LTLCardinality-01 1163800 m, 17021 m/sec, 6885568 t fired, .

Time elapsed: 65 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 28/32 AutoFlight-PT-24b-LTLCardinality-01 1248691 m, 16978 m/sec, 7412308 t fired, .

Time elapsed: 70 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 30/32 AutoFlight-PT-24b-LTLCardinality-01 1322394 m, 14740 m/sec, 7944858 t fired, .

Time elapsed: 75 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 31/32 AutoFlight-PT-24b-LTLCardinality-01 1396933 m, 14907 m/sec, 8480184 t fired, .

Time elapsed: 80 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-24b-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-24b-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-24b-LTLCardinality-01: LTL unknown AGGR


Time elapsed: 85 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
echo " Input is AutoFlight-PT-24b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595600491"
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 ;