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.r169-tall-167838856300740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678632594990

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:49:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:49:56] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-03-12 14:49:56] [INFO ] Transformed 2826 places.
[2023-03-12 14:49:56] [INFO ] Transformed 8960 transitions.
[2023-03-12 14:49:56] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 31 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c016-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3732
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3732
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Iterating post reduction 1 with 388 rules applied. Total rules applied 997 place count 1315 transition count 3344
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1149 place count 1163 transition count 3040
Iterating global reduction 2 with 152 rules applied. Total rules applied 1301 place count 1163 transition count 3040
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 1381 place count 1163 transition count 2960
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1395 place count 1149 transition count 2932
Iterating global reduction 3 with 14 rules applied. Total rules applied 1409 place count 1149 transition count 2932
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1423 place count 1135 transition count 2904
Iterating global reduction 3 with 14 rules applied. Total rules applied 1437 place count 1135 transition count 2904
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1451 place count 1121 transition count 2876
Iterating global reduction 3 with 14 rules applied. Total rules applied 1465 place count 1121 transition count 2876
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1479 place count 1107 transition count 2848
Iterating global reduction 3 with 14 rules applied. Total rules applied 1493 place count 1107 transition count 2848
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1507 place count 1093 transition count 2820
Iterating global reduction 3 with 14 rules applied. Total rules applied 1521 place count 1093 transition count 2820
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1534 place count 1080 transition count 2794
Iterating global reduction 3 with 13 rules applied. Total rules applied 1547 place count 1080 transition count 2794
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1560 place count 1067 transition count 2768
Iterating global reduction 3 with 13 rules applied. Total rules applied 1573 place count 1067 transition count 2768
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 1623 place count 1017 transition count 2582
Iterating global reduction 3 with 50 rules applied. Total rules applied 1673 place count 1017 transition count 2582
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1729 place count 961 transition count 2358
Iterating global reduction 3 with 56 rules applied. Total rules applied 1785 place count 961 transition count 2358
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1841 place count 905 transition count 2220
Iterating global reduction 3 with 56 rules applied. Total rules applied 1897 place count 905 transition count 2220
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1951 place count 851 transition count 2112
Iterating global reduction 3 with 54 rules applied. Total rules applied 2005 place count 851 transition count 2112
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2059 place count 797 transition count 2004
Iterating global reduction 3 with 54 rules applied. Total rules applied 2113 place count 797 transition count 2004
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2167 place count 743 transition count 1896
Iterating global reduction 3 with 54 rules applied. Total rules applied 2221 place count 743 transition count 1896
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2275 place count 689 transition count 1788
Iterating global reduction 3 with 54 rules applied. Total rules applied 2329 place count 689 transition count 1788
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2341 place count 677 transition count 1764
Iterating global reduction 3 with 12 rules applied. Total rules applied 2353 place count 677 transition count 1764
Applied a total of 2353 rules in 1214 ms. Remains 677 /1628 variables (removed 951) and now considering 1764/5962 (removed 4198) transitions.
[2023-03-12 14:49:58] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
// Phase 1: matrix 1183 rows 677 cols
[2023-03-12 14:49:58] [INFO ] Computed 2 place invariants in 27 ms
[2023-03-12 14:49:58] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-12 14:49:58] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-12 14:49:58] [INFO ] Invariant cache hit.
[2023-03-12 14:49:59] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-12 14:50:00] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-12 14:50:00] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-12 14:50:00] [INFO ] Invariant cache hit.
[2023-03-12 14:50:01] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 677/1628 places, 1764/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3847 ms. Remains : 677/1628 places, 1764/5962 transitions.
Support contains 20 out of 677 places after structural reductions.
[2023-03-12 14:50:01] [INFO ] Flatten gal took : 152 ms
[2023-03-12 14:50:01] [INFO ] Flatten gal took : 88 ms
[2023-03-12 14:50:01] [INFO ] Input system was already deterministic with 1764 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 14:50:02] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-12 14:50:02] [INFO ] Invariant cache hit.
[2023-03-12 14:50:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:03] [INFO ] After 1541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 14:50:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:50:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:05] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 14:50:05] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-12 14:50:06] [INFO ] After 952ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 14:50:06] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 4 ms to minimize.
[2023-03-12 14:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-12 14:50:07] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 1 ms to minimize.
[2023-03-12 14:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-12 14:50:07] [INFO ] After 2349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 730 ms.
[2023-03-12 14:50:08] [INFO ] After 4758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 39 ms.
Support contains 13 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 676 transition count 1762
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 676 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 675 transition count 1758
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 675 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 674 transition count 1754
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 674 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 673 transition count 1752
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 673 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 672 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 672 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 671 transition count 1748
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 671 transition count 1748
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 670 transition count 1746
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 670 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 669 transition count 1744
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 669 transition count 1744
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 669 transition count 1730
Applied a total of 30 rules in 456 ms. Remains 669 /677 variables (removed 8) and now considering 1730/1764 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 669/677 places, 1730/1764 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 188926 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188926 steps, saw 122643 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 14:50:12] [INFO ] Flow matrix only has 1162 transitions (discarded 568 similar events)
// Phase 1: matrix 1162 rows 669 cols
[2023-03-12 14:50:12] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 14:50:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:50:13] [INFO ] After 983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 14:50:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:15] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 14:50:15] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-12 14:50:15] [INFO ] After 893ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 14:50:16] [INFO ] After 1861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 652 ms.
[2023-03-12 14:50:17] [INFO ] After 4008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 58 ms.
Support contains 12 out of 669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 669/669 places, 1730/1730 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 668 transition count 1728
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 668 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 667 transition count 1726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 667 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 666 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 666 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 665 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 665 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 664 transition count 1718
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 664 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 663 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 663 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 662 transition count 1714
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 662 transition count 1714
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 661 transition count 1712
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 661 transition count 1712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 660 transition count 1710
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 660 transition count 1710
Applied a total of 18 rules in 218 ms. Remains 660 /669 variables (removed 9) and now considering 1710/1730 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 660/669 places, 1710/1730 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 14:50:18] [INFO ] Flow matrix only has 1148 transitions (discarded 562 similar events)
// Phase 1: matrix 1148 rows 660 cols
[2023-03-12 14:50:18] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 14:50:18] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:18] [INFO ] After 766ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 14:50:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:50:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:50:20] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:20] [INFO ] State equation strengthened by 285 read => feed constraints.
[2023-03-12 14:50:21] [INFO ] After 905ms SMT Verify possible using 285 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:22] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-12 14:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-12 14:50:22] [INFO ] After 1996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-12 14:50:23] [INFO ] After 4047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 42 ms.
Support contains 11 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 1710/1710 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 659 transition count 1708
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 659 transition count 1708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 659 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 658 transition count 1704
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 658 transition count 1704
Applied a total of 6 rules in 115 ms. Remains 658 /660 variables (removed 2) and now considering 1704/1710 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 658/660 places, 1704/1710 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 179845 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179845 steps, saw 116750 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-12 14:50:26] [INFO ] Flow matrix only has 1143 transitions (discarded 561 similar events)
// Phase 1: matrix 1143 rows 658 cols
[2023-03-12 14:50:26] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:50:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:27] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 14:50:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:28] [INFO ] After 925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:28] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:50:29] [INFO ] After 893ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:29] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-12 14:50:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-12 14:50:30] [INFO ] After 1969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-12 14:50:30] [INFO ] After 3658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 11 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1704/1704 transitions.
Applied a total of 0 rules in 81 ms. Remains 658 /658 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 658/658 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1704/1704 transitions.
Applied a total of 0 rules in 101 ms. Remains 658 /658 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-12 14:50:31] [INFO ] Flow matrix only has 1143 transitions (discarded 561 similar events)
[2023-03-12 14:50:31] [INFO ] Invariant cache hit.
[2023-03-12 14:50:31] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-12 14:50:31] [INFO ] Flow matrix only has 1143 transitions (discarded 561 similar events)
[2023-03-12 14:50:31] [INFO ] Invariant cache hit.
[2023-03-12 14:50:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:50:33] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-12 14:50:33] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 14:50:33] [INFO ] Flow matrix only has 1143 transitions (discarded 561 similar events)
[2023-03-12 14:50:33] [INFO ] Invariant cache hit.
[2023-03-12 14:50:34] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3005 ms. Remains : 658/658 places, 1704/1704 transitions.
Graph (trivial) has 999 edges and 658 vertex of which 189 / 658 are part of one of the 63 SCC in 5 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 435 transitions
Reduce isomorphic transitions removed 750 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 532 transition count 941
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 519 transition count 941
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 27 place count 519 transition count 854
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 201 place count 432 transition count 854
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 263 place count 370 transition count 792
Iterating global reduction 2 with 62 rules applied. Total rules applied 325 place count 370 transition count 792
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 449 place count 370 transition count 668
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 713 place count 238 transition count 536
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 777 place count 174 transition count 408
Iterating global reduction 3 with 64 rules applied. Total rules applied 841 place count 174 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 842 place count 174 transition count 407
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 905 place count 111 transition count 281
Iterating global reduction 4 with 63 rules applied. Total rules applied 968 place count 111 transition count 281
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1031 place count 48 transition count 155
Iterating global reduction 4 with 63 rules applied. Total rules applied 1094 place count 48 transition count 155
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1157 place count 48 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1157 place count 48 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1159 place count 47 transition count 91
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 5 with 2 rules applied. Total rules applied 1161 place count 46 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1169 place count 42 transition count 90
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1174 place count 42 transition count 85
Applied a total of 1174 rules in 98 ms. Remains 42 /658 variables (removed 616) and now considering 85/1704 (removed 1619) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 85 rows 42 cols
[2023-03-12 14:50:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:50:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:50:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:34] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 14:50:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:50:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:50:34] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:50:34] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 14:50:34] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-12 14:50:34] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 192 stabilizing places and 512 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(G((X(p1)||p0)))))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 307 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-12 14:50:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:50:34] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 14:50:35] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 14:50:35] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:50:35] [INFO ] Invariant cache hit.
[2023-03-12 14:50:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:50:37] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2023-03-12 14:50:37] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:50:37] [INFO ] Invariant cache hit.
[2023-03-12 14:50:37] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3120 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 746 ms.
Product exploration explored 100000 steps with 3 reset in 665 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 221352 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221352 steps, saw 143687 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:50:42] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:50:42] [INFO ] Invariant cache hit.
[2023-03-12 14:50:43] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:43] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 14:50:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:50:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:50:44] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 14:50:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:50:44] [INFO ] After 295ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 14:50:44] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2023-03-12 14:50:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-12 14:50:45] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-12 14:50:45] [INFO ] After 1508ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 154 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 293257 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293257 steps, saw 190355 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:50:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:50:48] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 14:50:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:50:49] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:50:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:50:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:50:49] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:50:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:50:49] [INFO ] After 319ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:50:50] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-12 14:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-12 14:50:50] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-12 14:50:50] [INFO ] After 1501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 84 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:50:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:50:50] [INFO ] Invariant cache hit.
[2023-03-12 14:50:51] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 14:50:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:50:51] [INFO ] Invariant cache hit.
[2023-03-12 14:50:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:50:53] [INFO ] Implicit Places using invariants and state equation in 1901 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2023-03-12 14:50:53] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-12 14:50:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:50:53] [INFO ] Invariant cache hit.
[2023-03-12 14:50:53] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2928 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 38 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-12 14:50:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:50:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:50:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:53] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 14:50:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:50:53] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:50:53] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:50:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:50:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:50:53] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:50:53] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:50:53] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 14:50:53] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:50:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:50:54] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:50:54] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-12 14:50:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:50:54] [INFO ] Invariant cache hit.
[2023-03-12 14:50:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:50:56] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
[2023-03-12 14:50:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:50:56] [INFO ] Invariant cache hit.
[2023-03-12 14:50:57] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2705 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 349600 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349600 steps, saw 226921 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:51:00] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:51:00] [INFO ] Invariant cache hit.
[2023-03-12 14:51:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:51:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:00] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:51:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:51:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:01] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:51:01] [INFO ] After 209ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:01] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-12 14:51:01] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 147 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 337558 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337558 steps, saw 219108 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:51:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:51:05] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 14:51:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:51:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:05] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:51:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:06] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:51:06] [INFO ] After 210ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:06] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-12 14:51:06] [INFO ] After 1134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 75 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:51:07] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:51:07] [INFO ] Invariant cache hit.
[2023-03-12 14:51:07] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 14:51:07] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:51:07] [INFO ] Invariant cache hit.
[2023-03-12 14:51:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:51:09] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-12 14:51:09] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 14:51:09] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:51:09] [INFO ] Invariant cache hit.
[2023-03-12 14:51:09] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2819 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 44 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-12 14:51:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:51:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:51:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:09] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 14:51:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:51:09] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:51:09] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:51:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:51:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:51:09] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:09] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:51:09] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 14:51:09] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3 reset in 514 ms.
Product exploration explored 100000 steps with 4 reset in 541 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:51:11] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:51:11] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:51:12] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-12 14:51:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:51:12] [INFO ] Invariant cache hit.
[2023-03-12 14:51:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:51:13] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2023-03-12 14:51:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:51:13] [INFO ] Invariant cache hit.
[2023-03-12 14:51:14] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2581 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 39998 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(X(F(!p0)))) U (p1||X(!p2))))'
Support contains 5 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 669 transition count 1748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 669 transition count 1748
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 669 transition count 1742
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 661 transition count 1722
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 654 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 654 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 647 transition count 1676
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 647 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 641 transition count 1662
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 641 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 635 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 635 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 629 transition count 1638
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 629 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 623 transition count 1626
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 619 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 618 transition count 1616
Applied a total of 124 rules in 174 ms. Remains 618 /677 variables (removed 59) and now considering 1616/1764 (removed 148) transitions.
[2023-03-12 14:51:14] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2023-03-12 14:51:14] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:51:15] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-12 14:51:15] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-12 14:51:15] [INFO ] Invariant cache hit.
[2023-03-12 14:51:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 14:51:16] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2023-03-12 14:51:16] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-12 14:51:16] [INFO ] Invariant cache hit.
[2023-03-12 14:51:17] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/677 places, 1616/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2789 ms. Remains : 618/677 places, 1616/1764 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), p0, p0]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s529 1)), p2:(AND (GEQ s1 1) (GEQ s546 1)), p0:(AND (GEQ s1 1) (GEQ s296 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 781 ms.
Product exploration explored 100000 steps with 50000 reset in 753 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-03 finished in 4610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(p0)&&p1))))'
Support contains 4 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 1742
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 657 transition count 1714
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 657 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 648 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 648 transition count 1684
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 639 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 639 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 632 transition count 1640
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 632 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 625 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 625 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 618 transition count 1612
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 618 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 611 transition count 1598
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 606 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 605 transition count 1586
Applied a total of 148 rules in 153 ms. Remains 605 /677 variables (removed 72) and now considering 1586/1764 (removed 178) transitions.
[2023-03-12 14:51:19] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-12 14:51:19] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:51:19] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 14:51:19] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 14:51:19] [INFO ] Invariant cache hit.
[2023-03-12 14:51:19] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 14:51:21] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
[2023-03-12 14:51:21] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 14:51:21] [INFO ] Invariant cache hit.
[2023-03-12 14:51:21] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/677 places, 1586/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2295 ms. Remains : 605/677 places, 1586/1764 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s151 1)), p1:(AND (GEQ s0 1) (GEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 2442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 614 transition count 1608
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 613 transition count 1606
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 136 place count 613 transition count 1602
Applied a total of 136 rules in 442 ms. Remains 613 /677 variables (removed 64) and now considering 1602/1764 (removed 162) transitions.
[2023-03-12 14:51:22] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-12 14:51:22] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 14:51:22] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 14:51:22] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-12 14:51:22] [INFO ] Invariant cache hit.
[2023-03-12 14:51:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:51:23] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2023-03-12 14:51:24] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 14:51:24] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-12 14:51:24] [INFO ] Invariant cache hit.
[2023-03-12 14:51:24] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/677 places, 1602/1764 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2894 ms. Remains : 613/677 places, 1602/1764 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s533 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 550 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 2952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 650 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 650 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 641 transition count 1662
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 641 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 634 transition count 1646
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 634 transition count 1646
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 627 transition count 1632
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 627 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 620 transition count 1618
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 620 transition count 1618
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 613 transition count 1604
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 613 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 608 transition count 1594
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 607 transition count 1592
Applied a total of 142 rules in 160 ms. Remains 607 /677 variables (removed 70) and now considering 1592/1764 (removed 172) transitions.
[2023-03-12 14:51:24] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-12 14:51:24] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 14:51:25] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 14:51:25] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-12 14:51:25] [INFO ] Invariant cache hit.
[2023-03-12 14:51:25] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 14:51:27] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
[2023-03-12 14:51:27] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-12 14:51:27] [INFO ] Invariant cache hit.
[2023-03-12 14:51:27] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/677 places, 1592/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2894 ms. Remains : 607/677 places, 1592/1764 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s521 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][false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 2982 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&&F(p1)))||X(X((p1 U (p2||G(p1))))))))'
Support contains 5 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 670 transition count 1748
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 670 transition count 1748
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 670 transition count 1744
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 663 transition count 1728
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 663 transition count 1728
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 657 transition count 1708
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 657 transition count 1708
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 651 transition count 1688
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 651 transition count 1688
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 646 transition count 1676
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 646 transition count 1676
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 641 transition count 1666
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 641 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 636 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 636 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 631 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 631 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 627 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 626 transition count 1636
Applied a total of 106 rules in 171 ms. Remains 626 /677 variables (removed 51) and now considering 1636/1764 (removed 128) transitions.
[2023-03-12 14:51:27] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-12 14:51:27] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:51:28] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-12 14:51:28] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:28] [INFO ] Invariant cache hit.
[2023-03-12 14:51:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:51:29] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2023-03-12 14:51:29] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:29] [INFO ] Invariant cache hit.
[2023-03-12 14:51:30] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/677 places, 1636/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2728 ms. Remains : 626/677 places, 1636/1764 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s544 1)), p1:(OR (LT s4 1) (LT s531 1)), p2:(AND (OR (LT s4 1) (LT s531 1)) (NOT (AND (GEQ s1 1) (GEQ s547 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 625 ms.
Product exploration explored 100000 steps with 25000 reset in 641 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 164369 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164369 steps, saw 106705 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-12 14:51:35] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:35] [INFO ] Invariant cache hit.
[2023-03-12 14:51:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:51:36] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-12 14:51:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:51:37] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 14:51:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:51:38] [INFO ] After 1061ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-12 14:51:39] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-12 14:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-12 14:51:39] [INFO ] After 2159ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 590 ms.
[2023-03-12 14:51:40] [INFO ] After 3917ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Graph (complete) has 2726 edges and 626 vertex of which 434 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 434 transition count 1252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 434 transition count 1246
Applied a total of 391 rules in 96 ms. Remains 434 /626 variables (removed 192) and now considering 1246/1636 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2023-03-12 14:51:40] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-12 14:51:40] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 14:51:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:41] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:51:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:41] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:41] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:51:41] [INFO ] After 157ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:41] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 14:51:41] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 47 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596980 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596980 steps, saw 366058 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:51:44] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:51:44] [INFO ] Invariant cache hit.
[2023-03-12 14:51:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:45] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:51:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:45] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:45] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:51:45] [INFO ] After 159ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:45] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 14:51:46] [INFO ] After 745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 45 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 434/434 places, 1246/1246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 44 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2023-03-12 14:51:46] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:51:46] [INFO ] Invariant cache hit.
[2023-03-12 14:51:46] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-12 14:51:46] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:51:46] [INFO ] Invariant cache hit.
[2023-03-12 14:51:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:51:47] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2023-03-12 14:51:47] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 14:51:47] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:51:47] [INFO ] Invariant cache hit.
[2023-03-12 14:51:47] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 434/434 places, 1246/1246 transitions.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 434 transition count 698
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 559 place count 423 transition count 698
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 559 place count 423 transition count 622
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 711 place count 347 transition count 622
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 969 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1033 place count 154 transition count 365
Iterating global reduction 2 with 64 rules applied. Total rules applied 1097 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1161 place count 91 transition count 238
Iterating global reduction 3 with 63 rules applied. Total rules applied 1224 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1287 place count 28 transition count 112
Iterating global reduction 3 with 63 rules applied. Total rules applied 1350 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1413 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1413 place count 28 transition count 48
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 1415 place count 27 transition count 48
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 4 with 2 rules applied. Total rules applied 1417 place count 26 transition count 47
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 1419 place count 25 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1420 place count 25 transition count 46
Applied a total of 1420 rules in 25 ms. Remains 25 /434 variables (removed 409) and now considering 46/1246 (removed 1200) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 25 cols
[2023-03-12 14:51:47] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 14:51:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 14:51:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:51:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:51:47] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:51:47] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:51:47] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 14:51:47] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 438 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2023-03-12 14:51:49] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-12 14:51:49] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 14:51:49] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-12 14:51:49] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:49] [INFO ] Invariant cache hit.
[2023-03-12 14:51:49] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:51:51] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2023-03-12 14:51:51] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:51] [INFO ] Invariant cache hit.
[2023-03-12 14:51:51] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2705 ms. Remains : 626/626 places, 1636/1636 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p2 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:51:52] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:51:52] [INFO ] Invariant cache hit.
[2023-03-12 14:51:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:51:52] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:51:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:51:53] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:51:53] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:51:54] [INFO ] After 413ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:51:54] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-12 14:51:55] [INFO ] After 2044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Graph (complete) has 2726 edges and 626 vertex of which 434 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 434 transition count 1252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 434 transition count 1246
Applied a total of 391 rules in 94 ms. Remains 434 /626 variables (removed 192) and now considering 1246/1636 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:51:55] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-12 14:51:55] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 14:51:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:55] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:51:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:55] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:51:55] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:51:56] [INFO ] After 235ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:51:56] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-12 14:51:56] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 45 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 234321 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234321 steps, saw 143698 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:51:59] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:51:59] [INFO ] Invariant cache hit.
[2023-03-12 14:51:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:51:59] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:52:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:00] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:52:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:52:00] [INFO ] After 246ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:52:00] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-12 14:52:01] [INFO ] After 1172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 51 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 434/434 places, 1246/1246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Applied a total of 0 rules in 53 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2023-03-12 14:52:01] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:52:01] [INFO ] Invariant cache hit.
[2023-03-12 14:52:01] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 14:52:01] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:52:01] [INFO ] Invariant cache hit.
[2023-03-12 14:52:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 14:52:02] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-03-12 14:52:02] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 14:52:02] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-12 14:52:02] [INFO ] Invariant cache hit.
[2023-03-12 14:52:02] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1724 ms. Remains : 434/434 places, 1246/1246 transitions.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 434 transition count 698
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 559 place count 423 transition count 698
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 559 place count 423 transition count 622
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 711 place count 347 transition count 622
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 969 place count 218 transition count 493
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1033 place count 154 transition count 365
Iterating global reduction 2 with 64 rules applied. Total rules applied 1097 place count 154 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1098 place count 154 transition count 364
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1161 place count 91 transition count 238
Iterating global reduction 3 with 63 rules applied. Total rules applied 1224 place count 91 transition count 238
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1287 place count 28 transition count 112
Iterating global reduction 3 with 63 rules applied. Total rules applied 1350 place count 28 transition count 112
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1413 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1413 place count 28 transition count 48
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 1415 place count 27 transition count 48
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 4 with 2 rules applied. Total rules applied 1417 place count 26 transition count 47
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 1419 place count 25 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1420 place count 25 transition count 46
Applied a total of 1420 rules in 26 ms. Remains 25 /434 variables (removed 409) and now considering 46/1246 (removed 1200) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 46 rows 25 cols
[2023-03-12 14:52:02] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 14:52:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 14:52:03] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:52:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 14:52:03] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:52:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:52:03] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:52:03] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-12 14:52:03] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p2 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 615 ms.
Product exploration explored 100000 steps with 25000 reset in 615 ms.
Applying partial POR strategy [false, false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1630
Applied a total of 6 rules in 284 ms. Remains 626 /626 variables (removed 0) and now considering 1630/1636 (removed 6) transitions.
[2023-03-12 14:52:06] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 14:52:06] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
// Phase 1: matrix 1091 rows 626 cols
[2023-03-12 14:52:06] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:52:06] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 626/626 places, 1630/1636 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 827 ms. Remains : 626/626 places, 1630/1636 transitions.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1636/1636 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2023-03-12 14:52:06] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-12 14:52:06] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:52:07] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-12 14:52:07] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:52:07] [INFO ] Invariant cache hit.
[2023-03-12 14:52:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 14:52:08] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2023-03-12 14:52:08] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-12 14:52:08] [INFO ] Invariant cache hit.
[2023-03-12 14:52:09] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2551 ms. Remains : 626/626 places, 1636/1636 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 41891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 637 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 637 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 631 transition count 1644
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 631 transition count 1644
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 625 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 625 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 619 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 619 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 615 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 615 transition count 1612
Applied a total of 126 rules in 163 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-12 14:52:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:52:09] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:52:10] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-12 14:52:10] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:10] [INFO ] Invariant cache hit.
[2023-03-12 14:52:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:11] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
[2023-03-12 14:52:11] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:11] [INFO ] Invariant cache hit.
[2023-03-12 14:52:12] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/677 places, 1612/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2835 ms. Remains : 615/677 places, 1612/1764 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33276 reset in 659 ms.
Product exploration explored 100000 steps with 33372 reset in 653 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 301638 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301638 steps, saw 195795 distinct states, run finished after 3004 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:52:17] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:17] [INFO ] Invariant cache hit.
[2023-03-12 14:52:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:17] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:18] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:19] [INFO ] After 420ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:19] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2023-03-12 14:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-12 14:52:19] [INFO ] After 1038ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-12 14:52:19] [INFO ] After 2014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 147 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 272721 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272721 steps, saw 177027 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:52:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 14:52:23] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 14:52:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:23] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:52:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:24] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:24] [INFO ] After 418ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:25] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2023-03-12 14:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-12 14:52:25] [INFO ] After 958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-12 14:52:25] [INFO ] After 1840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:52:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:25] [INFO ] Invariant cache hit.
[2023-03-12 14:52:26] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-12 14:52:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:26] [INFO ] Invariant cache hit.
[2023-03-12 14:52:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:27] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-03-12 14:52:27] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 14:52:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:27] [INFO ] Invariant cache hit.
[2023-03-12 14:52:28] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2520 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 37 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-12 14:52:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:52:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:52:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:28] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:52:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:52:28] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:28] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:52:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:28] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:28] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:28] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 14:52:28] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 13 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-12 14:52:28] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:52:28] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:52:29] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-12 14:52:29] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:29] [INFO ] Invariant cache hit.
[2023-03-12 14:52:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:30] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2023-03-12 14:52:30] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:30] [INFO ] Invariant cache hit.
[2023-03-12 14:52:31] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2599 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 286245 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286245 steps, saw 185805 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:52:34] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:34] [INFO ] Invariant cache hit.
[2023-03-12 14:52:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:35] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:52:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:36] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:36] [INFO ] After 424ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:36] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2023-03-12 14:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-12 14:52:37] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-03-12 14:52:37] [INFO ] After 2008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 147 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 182798 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182798 steps, saw 118667 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:52:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 14:52:40] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-12 14:52:40] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:52:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:41] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:52:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:42] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:42] [INFO ] After 410ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:42] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 1 ms to minimize.
[2023-03-12 14:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-12 14:52:42] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-12 14:52:43] [INFO ] After 1761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 76 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:52:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:43] [INFO ] Invariant cache hit.
[2023-03-12 14:52:43] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 14:52:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:43] [INFO ] Invariant cache hit.
[2023-03-12 14:52:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:45] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
[2023-03-12 14:52:45] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 14:52:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:45] [INFO ] Invariant cache hit.
[2023-03-12 14:52:45] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2488 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 33 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-12 14:52:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 14:52:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:52:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:52:45] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:52:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:52:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:45] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:52:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:52:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:52:45] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:45] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:52:45] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 14:52:45] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33459 reset in 659 ms.
Product exploration explored 100000 steps with 33381 reset in 658 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 20 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-12 14:52:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:52:47] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:52:48] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 14:52:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:48] [INFO ] Invariant cache hit.
[2023-03-12 14:52:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:49] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
[2023-03-12 14:52:49] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:52:49] [INFO ] Invariant cache hit.
[2023-03-12 14:52:50] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2434 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 40937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 667 transition count 1742
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 667 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 667 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 657 transition count 1714
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 657 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 648 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 648 transition count 1684
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 639 transition count 1656
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 639 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 632 transition count 1640
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 632 transition count 1640
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 625 transition count 1626
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 625 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 618 transition count 1612
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 618 transition count 1612
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 611 transition count 1598
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 606 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 605 transition count 1584
Applied a total of 150 rules in 325 ms. Remains 605 /677 variables (removed 72) and now considering 1584/1764 (removed 180) transitions.
[2023-03-12 14:52:50] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 14:52:50] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:52:51] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 14:52:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-12 14:52:51] [INFO ] Invariant cache hit.
[2023-03-12 14:52:51] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 14:52:52] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2023-03-12 14:52:52] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 14:52:52] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-12 14:52:52] [INFO ] Invariant cache hit.
[2023-03-12 14:52:53] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/677 places, 1584/1764 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2900 ms. Remains : 605/677 places, 1584/1764 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 443 ms.
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-14 finished in 3402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 177 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-12 14:52:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:52:54] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 14:52:54] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-12 14:52:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:54] [INFO ] Invariant cache hit.
[2023-03-12 14:52:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:52:56] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
[2023-03-12 14:52:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:56] [INFO ] Invariant cache hit.
[2023-03-12 14:52:56] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2945 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s191 1)), p0:(OR (LT s1 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 744 ms.
Product exploration explored 100000 steps with 50000 reset in 742 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLFireability-15 finished in 4704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLFireability-02
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 677 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 668 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 659 transition count 1718
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 637 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 631 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 631 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 625 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 625 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 619 transition count 1618
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 614 transition count 1608
Applied a total of 130 rules in 201 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-12 14:52:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:52:58] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 14:52:59] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 14:52:59] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:52:59] [INFO ] Invariant cache hit.
[2023-03-12 14:52:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:01] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2023-03-12 14:53:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:01] [INFO ] Invariant cache hit.
[2023-03-12 14:53:01] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 614/677 places, 1608/1764 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3210 ms. Remains : 614/677 places, 1608/1764 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s0 1) (LT s542 1)), p0:(OR (LT s0 1) (LT s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 454 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 247276 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247276 steps, saw 160514 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:53:06] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:06] [INFO ] Invariant cache hit.
[2023-03-12 14:53:06] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 14:53:07] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 14:53:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:07] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 14:53:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:07] [INFO ] After 306ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 14:53:08] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-12 14:53:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-12 14:53:08] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-12 14:53:08] [INFO ] After 1526ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 152 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 255819 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255819 steps, saw 166057 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:53:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:53:11] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 14:53:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:12] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:13] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:13] [INFO ] After 339ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:13] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-12 14:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-12 14:53:14] [INFO ] After 797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-12 14:53:14] [INFO ] After 1594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:53:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:14] [INFO ] Invariant cache hit.
[2023-03-12 14:53:14] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 14:53:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:14] [INFO ] Invariant cache hit.
[2023-03-12 14:53:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:16] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-12 14:53:16] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:53:16] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:16] [INFO ] Invariant cache hit.
[2023-03-12 14:53:16] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2556 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 31 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-12 14:53:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:53:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:53:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:16] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 14:53:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:53:16] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:16] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:53:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:16] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:16] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:16] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 14:53:16] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 18 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:53:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:53:17] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 14:53:17] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 14:53:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:17] [INFO ] Invariant cache hit.
[2023-03-12 14:53:18] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:19] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-12 14:53:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:19] [INFO ] Invariant cache hit.
[2023-03-12 14:53:19] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2372 ms. Remains : 614/614 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263814 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263814 steps, saw 171246 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:53:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:23] [INFO ] Invariant cache hit.
[2023-03-12 14:53:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:23] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:53:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:53:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:24] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:24] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:24] [INFO ] After 209ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:24] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-12 14:53:24] [INFO ] After 1101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1604
Applied a total of 4 rules in 149 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 341975 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341975 steps, saw 221974 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:53:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 14:53:28] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 14:53:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:28] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:53:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:29] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:29] [INFO ] After 212ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:29] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-12 14:53:29] [INFO ] After 1135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 77 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 14:53:29] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:29] [INFO ] Invariant cache hit.
[2023-03-12 14:53:30] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 14:53:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:30] [INFO ] Invariant cache hit.
[2023-03-12 14:53:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:31] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2023-03-12 14:53:31] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 14:53:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 14:53:31] [INFO ] Invariant cache hit.
[2023-03-12 14:53:32] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2585 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
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 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 30 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 34 rows 20 cols
[2023-03-12 14:53:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:53:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:53:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:32] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 14:53:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:53:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:53:32] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:53:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:53:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:32] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:32] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:53:32] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 14:53:32] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 4 reset in 522 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Applied a total of 0 rules in 20 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:53:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-12 14:53:34] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 14:53:34] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-12 14:53:34] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:34] [INFO ] Invariant cache hit.
[2023-03-12 14:53:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:36] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2023-03-12 14:53:36] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:36] [INFO ] Invariant cache hit.
[2023-03-12 14:53:36] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2751 ms. Remains : 614/614 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 38478 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&&F(p1)))||X(X((p1 U (p2||G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((G(p0)||p1))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 677 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 677/677 places, 1764/1764 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 668 transition count 1744
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 668 transition count 1744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 668 transition count 1742
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 659 transition count 1720
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 659 transition count 1720
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 651 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 651 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 643 transition count 1668
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 643 transition count 1668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 637 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 637 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 631 transition count 1644
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 631 transition count 1644
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 625 transition count 1632
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 625 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 619 transition count 1620
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 619 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 615 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 615 transition count 1612
Applied a total of 126 rules in 169 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-12 14:53:37] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:53:37] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 14:53:37] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-12 14:53:37] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:53:37] [INFO ] Invariant cache hit.
[2023-03-12 14:53:38] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:39] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2023-03-12 14:53:39] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:53:39] [INFO ] Invariant cache hit.
[2023-03-12 14:53:39] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 615/677 places, 1612/1764 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2566 ms. Remains : 615/677 places, 1612/1764 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s375 1)), p1:(OR (LT s0 1) (LT s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33367 reset in 656 ms.
Product exploration explored 100000 steps with 33382 reset in 661 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 260198 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260198 steps, saw 168899 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:53:44] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:53:44] [INFO ] Invariant cache hit.
[2023-03-12 14:53:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:53:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:45] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:46] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:46] [INFO ] After 414ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:46] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2023-03-12 14:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-12 14:53:47] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 301 ms.
[2023-03-12 14:53:47] [INFO ] After 2026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 145 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 279161 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279161 steps, saw 181207 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:53:50] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 14:53:50] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 14:53:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:51] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:53:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:51] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:52] [INFO ] After 441ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:52] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 1 ms to minimize.
[2023-03-12 14:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-12 14:53:52] [INFO ] After 948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-12 14:53:52] [INFO ] After 1845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 73 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:53:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:53] [INFO ] Invariant cache hit.
[2023-03-12 14:53:53] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-12 14:53:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:53] [INFO ] Invariant cache hit.
[2023-03-12 14:53:53] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:55] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2023-03-12 14:53:55] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:53:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:53:55] [INFO ] Invariant cache hit.
[2023-03-12 14:53:55] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2642 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 28 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-12 14:53:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:53:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:53:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:53:55] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:53:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:53:55] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:55] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:53:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:53:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:53:55] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:55] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:53:55] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 14:53:55] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 17 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-12 14:53:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:53:56] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 14:53:56] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 14:53:56] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:53:56] [INFO ] Invariant cache hit.
[2023-03-12 14:53:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:53:58] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2023-03-12 14:53:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:53:58] [INFO ] Invariant cache hit.
[2023-03-12 14:53:59] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2885 ms. Remains : 615/615 places, 1612/1612 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 305908 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305908 steps, saw 198566 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:54:02] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:54:02] [INFO ] Invariant cache hit.
[2023-03-12 14:54:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:54:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:03] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:54:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:54:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:04] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:54:04] [INFO ] After 411ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:04] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 1 ms to minimize.
[2023-03-12 14:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-12 14:54:05] [INFO ] After 1034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-12 14:54:05] [INFO ] After 2026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1608
Applied a total of 4 rules in 145 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1612 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 276961 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276961 steps, saw 179778 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:54:08] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-12 14:54:08] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 14:54:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:54:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:54:09] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:54:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:54:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:09] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:54:10] [INFO ] After 412ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:10] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2023-03-12 14:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-12 14:54:10] [INFO ] After 919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-12 14:54:10] [INFO ] After 1760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 77 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 615/615 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 14:54:11] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:54:11] [INFO ] Invariant cache hit.
[2023-03-12 14:54:11] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-12 14:54:11] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:54:11] [INFO ] Invariant cache hit.
[2023-03-12 14:54:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:54:13] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-12 14:54:13] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 14:54:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-12 14:54:13] [INFO ] Invariant cache hit.
[2023-03-12 14:54:13] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2606 ms. Remains : 615/615 places, 1608/1608 transitions.
Graph (trivial) has 945 edges and 615 vertex of which 189 / 615 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 489 transition count 874
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 479 transition count 874
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 21 place count 479 transition count 800
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 169 place count 405 transition count 800
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 231 place count 343 transition count 738
Iterating global reduction 2 with 62 rules applied. Total rules applied 293 place count 343 transition count 738
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 417 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 673 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 151 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 151 transition count 357
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 88 transition count 231
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 88 transition count 231
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 25 transition count 105
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 25 transition count 105
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 25 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 25 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 24 transition count 41
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 5 with 2 rules applied. Total rules applied 1121 place count 23 transition count 40
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 5 with 2 rules applied. Total rules applied 1123 place count 22 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1126 place count 22 transition count 37
Applied a total of 1126 rules in 32 ms. Remains 22 /615 variables (removed 593) and now considering 37/1608 (removed 1571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 37 rows 22 cols
[2023-03-12 14:54:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 14:54:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:54:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:54:13] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:54:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:54:13] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:54:13] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:54:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:54:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:13] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:13] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:54:13] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 14:54:13] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33216 reset in 696 ms.
Product exploration explored 100000 steps with 33426 reset in 697 ms.
Support contains 3 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1612/1612 transitions.
Applied a total of 0 rules in 21 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-12 14:54:15] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-12 14:54:15] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 14:54:16] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 14:54:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:54:16] [INFO ] Invariant cache hit.
[2023-03-12 14:54:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 14:54:18] [INFO ] Implicit Places using invariants and state equation in 2156 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
[2023-03-12 14:54:18] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-12 14:54:18] [INFO ] Invariant cache hit.
[2023-03-12 14:54:19] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3075 ms. Remains : 615/615 places, 1612/1612 transitions.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 41992 ms.
[2023-03-12 14:54:19] [INFO ] Flatten gal took : 65 ms
[2023-03-12 14:54:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 14:54:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 677 places, 1764 transitions and 7182 arcs took 13 ms.
Total runtime 262767 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2356/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2356/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2356/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-c016-LTLFireability-02
Could not compute solution for formula : FunctionPointer-PT-c016-LTLFireability-10
Could not compute solution for formula : FunctionPointer-PT-c016-LTLFireability-12

BK_STOP 1678632861578

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-c016-LTLFireability-02
ltl formula formula --ltl=/tmp/2356/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 677 places, 1764 transitions and 7182 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2356/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2356/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2356/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.060 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2356/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-c016-LTLFireability-10
ltl formula formula --ltl=/tmp/2356/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 677 places, 1764 transitions and 7182 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.070 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2356/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2356/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2356/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2356/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FunctionPointer-PT-c016-LTLFireability-12
ltl formula formula --ltl=/tmp/2356/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 677 places, 1764 transitions and 7182 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.040 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2356/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2356/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2356/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2356/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c016, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856300740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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