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.r165-tall-167838850800740.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 itstools
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 r165-tall-167838850800740
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 12:45:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 12:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:45:21] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2023-03-23 12:45:21] [INFO ] Transformed 2826 places.
[2023-03-23 12:45:21] [INFO ] Transformed 8960 transitions.
[2023-03-23 12:45:21] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 41 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 1148 ms. Remains 677 /1628 variables (removed 951) and now considering 1764/5962 (removed 4198) transitions.
[2023-03-23 12:45:23] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
// Phase 1: matrix 1183 rows 677 cols
[2023-03-23 12:45:23] [INFO ] Computed 2 place invariants in 30 ms
[2023-03-23 12:45:23] [INFO ] Implicit Places using invariants in 621 ms returned []
[2023-03-23 12:45:23] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-23 12:45:23] [INFO ] Invariant cache hit.
[2023-03-23 12:45:24] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-23 12:45:25] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2023-03-23 12:45:25] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-23 12:45:25] [INFO ] Invariant cache hit.
[2023-03-23 12:45:26] [INFO ] Dead Transitions using invariants and state equation in 587 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 3845 ms. Remains : 677/1628 places, 1764/5962 transitions.
Support contains 20 out of 677 places after structural reductions.
[2023-03-23 12:45:26] [INFO ] Flatten gal took : 129 ms
[2023-03-23 12:45:26] [INFO ] Flatten gal took : 83 ms
[2023-03-23 12:45:26] [INFO ] Input system was already deterministic with 1764 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-23 12:45:27] [INFO ] Flow matrix only has 1183 transitions (discarded 581 similar events)
[2023-03-23 12:45:27] [INFO ] Invariant cache hit.
[2023-03-23 12:45:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:45:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-23 12:45:29] [INFO ] After 2527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 12:45:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:31] [INFO ] After 1664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-23 12:45:31] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-23 12:45:33] [INFO ] After 1292ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-23 12:45:33] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 4 ms to minimize.
[2023-03-23 12:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-23 12:45:34] [INFO ] After 3001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 983 ms.
[2023-03-23 12:45:35] [INFO ] After 6056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 165 ms.
Support contains 16 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 1760
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 675 transition count 1760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 674 transition count 1756
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 674 transition count 1756
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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 668 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 668 transition count 1742
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 32 place count 668 transition count 1728
Applied a total of 32 rules in 500 ms. Remains 668 /677 variables (removed 9) and now considering 1728/1764 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 668/677 places, 1728/1764 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-23 12:45:36] [INFO ] Flow matrix only has 1161 transitions (discarded 567 similar events)
// Phase 1: matrix 1161 rows 668 cols
[2023-03-23 12:45:36] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 12:45:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:38] [INFO ] After 1669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 12:45:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:40] [INFO ] After 1260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 12:45:40] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-23 12:45:41] [INFO ] After 1051ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 12:45:41] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-23 12:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-23 12:45:42] [INFO ] After 2356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 717 ms.
[2023-03-23 12:45:43] [INFO ] After 4663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 85 ms.
Support contains 13 out of 668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 668/668 places, 1728/1728 transitions.
Applied a total of 0 rules in 96 ms. Remains 668 /668 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 668/668 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :1
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 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 138820 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138820 steps, saw 90126 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-23 12:45:46] [INFO ] Flow matrix only has 1161 transitions (discarded 567 similar events)
[2023-03-23 12:45:46] [INFO ] Invariant cache hit.
[2023-03-23 12:45:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:48] [INFO ] After 1538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 12:45:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:45:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:45:49] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 12:45:49] [INFO ] State equation strengthened by 288 read => feed constraints.
[2023-03-23 12:45:50] [INFO ] After 904ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 12:45:51] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 1 ms to minimize.
[2023-03-23 12:45:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-23 12:45:51] [INFO ] After 1970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 634 ms.
[2023-03-23 12:45:52] [INFO ] After 4039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 98 ms.
Support contains 12 out of 668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 668/668 places, 1728/1728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 667 transition count 1726
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 667 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 666 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 666 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 665 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 665 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 664 transition count 1718
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 664 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 663 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 663 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 662 transition count 1714
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 662 transition count 1714
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 661 transition count 1712
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 661 transition count 1712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 660 transition count 1710
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 660 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 659 transition count 1708
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 659 transition count 1708
Applied a total of 18 rules in 223 ms. Remains 659 /668 variables (removed 9) and now considering 1708/1728 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 659/668 places, 1708/1728 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 141879 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141879 steps, saw 92110 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-23 12:45:56] [INFO ] Flow matrix only has 1147 transitions (discarded 561 similar events)
// Phase 1: matrix 1147 rows 659 cols
[2023-03-23 12:45:56] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-23 12:45:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:45:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:45:57] [INFO ] After 1619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 12:45:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:45:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-23 12:45:59] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 12:45:59] [INFO ] State equation strengthened by 285 read => feed constraints.
[2023-03-23 12:46:00] [INFO ] After 1036ms SMT Verify possible using 285 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 12:46:00] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-23 12:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-23 12:46:01] [INFO ] After 2206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 739 ms.
[2023-03-23 12:46:02] [INFO ] After 4408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 41 ms.
Support contains 12 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1708/1708 transitions.
Applied a total of 0 rules in 80 ms. Remains 659 /659 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 659/659 places, 1708/1708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1708/1708 transitions.
Applied a total of 0 rules in 80 ms. Remains 659 /659 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
[2023-03-23 12:46:02] [INFO ] Flow matrix only has 1147 transitions (discarded 561 similar events)
[2023-03-23 12:46:02] [INFO ] Invariant cache hit.
[2023-03-23 12:46:02] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-23 12:46:02] [INFO ] Flow matrix only has 1147 transitions (discarded 561 similar events)
[2023-03-23 12:46:02] [INFO ] Invariant cache hit.
[2023-03-23 12:46:02] [INFO ] State equation strengthened by 285 read => feed constraints.
[2023-03-23 12:46:04] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
[2023-03-23 12:46:04] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-23 12:46:04] [INFO ] Flow matrix only has 1147 transitions (discarded 561 similar events)
[2023-03-23 12:46:04] [INFO ] Invariant cache hit.
[2023-03-23 12:46:04] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2722 ms. Remains : 659/659 places, 1708/1708 transitions.
Graph (trivial) has 999 edges and 659 vertex of which 189 / 659 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 533 transition count 945
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 520 transition count 945
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 27 place count 520 transition count 859
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 199 place count 434 transition count 859
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 261 place count 372 transition count 797
Iterating global reduction 2 with 62 rules applied. Total rules applied 323 place count 372 transition count 797
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 447 place count 372 transition count 673
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 1 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 713 place count 239 transition count 540
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 777 place count 175 transition count 412
Iterating global reduction 3 with 64 rules applied. Total rules applied 841 place count 175 transition count 412
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 175 transition count 411
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 905 place count 112 transition count 285
Iterating global reduction 4 with 63 rules applied. Total rules applied 968 place count 112 transition count 285
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1031 place count 49 transition count 159
Iterating global reduction 4 with 63 rules applied. Total rules applied 1094 place count 49 transition count 159
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 49 transition count 96
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 49 transition count 95
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 48 transition count 95
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 47 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1167 place count 44 transition count 94
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1176 place count 44 transition count 85
Applied a total of 1176 rules in 73 ms. Remains 44 /659 variables (removed 615) and now considering 85/1708 (removed 1623) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 85 rows 44 cols
[2023-03-23 12:46:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 12:46:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 12:46:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:05] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-23 12:46:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:46:05] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 12:46:05] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 12:46:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:46:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:05] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 12:46:05] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 12:46:05] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-23 12:46:05] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
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 301 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-23 12:46:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:46:05] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 12:46:06] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-23 12:46:06] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:06] [INFO ] Invariant cache hit.
[2023-03-23 12:46:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:07] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-03-23 12:46:07] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:07] [INFO ] Invariant cache hit.
[2023-03-23 12:46:08] [INFO ] Dead Transitions using invariants and state equation in 498 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 2773 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 314 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 0 reset in 577 ms.
Product exploration explored 100000 steps with 0 reset in 593 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 165 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 158 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) 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 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 206528 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206528 steps, saw 134068 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:46:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:13] [INFO ] Invariant cache hit.
[2023-03-23 12:46:13] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:14] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-23 12:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:46:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:14] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-23 12:46:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:14] [INFO ] After 312ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-23 12:46:15] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-23 12:46:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-23 12:46:15] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-23 12:46:15] [INFO ] After 1560ms 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 30 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 194 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 195 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) 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 252998 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252998 steps, saw 164228 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:46:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 12:46:18] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 12:46:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:46:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:19] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:46:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:20] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:46:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:20] [INFO ] After 319ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:46:20] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2023-03-23 12:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-23 12:46:20] [INFO ] After 767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-23 12:46:21] [INFO ] After 1520ms 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 79 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 80 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 74 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 12:46:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:21] [INFO ] Invariant cache hit.
[2023-03-23 12:46:21] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-23 12:46:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:21] [INFO ] Invariant cache hit.
[2023-03-23 12:46:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:23] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2023-03-23 12:46:23] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-23 12:46:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:23] [INFO ] Invariant cache hit.
[2023-03-23 12:46:23] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2582 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 2 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 42 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-23 12:46:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:46:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 12:46:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:23] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-23 12:46:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:46:23] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:46:23] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:46:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-23 12:46:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:23] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:46:23] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:46:23] [INFO ] After 14ms 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-23 12:46:23] [INFO ] After 63ms 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 172 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 181 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 190 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 16 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:46:24] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:46:24] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-23 12:46:24] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-23 12:46:24] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:24] [INFO ] Invariant cache hit.
[2023-03-23 12:46:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:26] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-03-23 12:46:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:26] [INFO ] Invariant cache hit.
[2023-03-23 12:46:27] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2577 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 95 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 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) 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
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 259573 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259573 steps, saw 168494 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 12:46:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:30] [INFO ] Invariant cache hit.
[2023-03-23 12:46:30] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:31] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:46:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:31] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:31] [INFO ] After 214ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:31] [INFO ] After 429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-23 12:46:32] [INFO ] After 1103ms 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, 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 160 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 161 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294958 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294958 steps, saw 191459 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 12:46:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 12:46:35] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 12:46:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:46:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:35] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:46:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:46:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:36] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:36] [INFO ] After 210ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:36] [INFO ] After 440ms 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-23 12:46:37] [INFO ] After 1145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 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-23 12:46:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:37] [INFO ] Invariant cache hit.
[2023-03-23 12:46:37] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-23 12:46:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:37] [INFO ] Invariant cache hit.
[2023-03-23 12:46:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:39] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-03-23 12:46:39] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-23 12:46:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:46:39] [INFO ] Invariant cache hit.
[2023-03-23 12:46:39] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2641 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 33 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-23 12:46:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:46:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:46:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:46:39] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 12:46:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:46:39] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:46:39] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:46:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:46:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:46:39] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:39] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:46:39] [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-23 12:46:39] [INFO ] After 52ms 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 99 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 179 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 204 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 172 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 2 reset in 448 ms.
Product exploration explored 100000 steps with 2 reset in 529 ms.
Built C files in :
/tmp/ltsmin17356791860247236251
[2023-03-23 12:46:41] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17356791860247236251
Running compilation step : cd /tmp/ltsmin17356791860247236251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2946 ms.
Running link step : cd /tmp/ltsmin17356791860247236251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17356791860247236251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4565870188588096125.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 17 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:46:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:46:56] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 12:46:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-23 12:46:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:57] [INFO ] Invariant cache hit.
[2023-03-23 12:46:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:46:58] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2023-03-23 12:46:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:46:58] [INFO ] Invariant cache hit.
[2023-03-23 12:46:59] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2391 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin12631410414450819310
[2023-03-23 12:46:59] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631410414450819310
Running compilation step : cd /tmp/ltsmin12631410414450819310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2971 ms.
Running link step : cd /tmp/ltsmin12631410414450819310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12631410414450819310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5005278989455580211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 12:47:14] [INFO ] Flatten gal took : 54 ms
[2023-03-23 12:47:14] [INFO ] Flatten gal took : 56 ms
[2023-03-23 12:47:14] [INFO ] Time to serialize gal into /tmp/LTL9318544477135061844.gal : 15 ms
[2023-03-23 12:47:14] [INFO ] Time to serialize properties into /tmp/LTL6443286092287750140.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9318544477135061844.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3760199329440849557.hoa' '-atoms' '/tmp/LTL6443286092287750140.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6443286092287750140.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3760199329440849557.hoa
Detected timeout of ITS tools.
[2023-03-23 12:47:29] [INFO ] Flatten gal took : 48 ms
[2023-03-23 12:47:29] [INFO ] Flatten gal took : 52 ms
[2023-03-23 12:47:29] [INFO ] Time to serialize gal into /tmp/LTL8360657091852698026.gal : 8 ms
[2023-03-23 12:47:29] [INFO ] Time to serialize properties into /tmp/LTL2694197901752128791.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8360657091852698026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2694197901752128791.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2023-03-23 12:47:44] [INFO ] Flatten gal took : 48 ms
[2023-03-23 12:47:44] [INFO ] Applying decomposition
[2023-03-23 12:47:44] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4758661703293788480.txt' '-o' '/tmp/graph4758661703293788480.bin' '-w' '/tmp/graph4758661703293788480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4758661703293788480.bin' '-l' '-1' '-v' '-w' '/tmp/graph4758661703293788480.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:47:45] [INFO ] Decomposing Gal with order
[2023-03-23 12:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:47:45] [INFO ] Removed a total of 2669 redundant transitions.
[2023-03-23 12:47:45] [INFO ] Flatten gal took : 144 ms
[2023-03-23 12:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1077 labels/synchronizations in 73 ms.
[2023-03-23 12:47:45] [INFO ] Time to serialize gal into /tmp/LTL877536983425929850.gal : 13 ms
[2023-03-23 12:47:45] [INFO ] Time to serialize properties into /tmp/LTL18023222921634340915.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL877536983425929850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18023222921634340915.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i1.u1.s0<1)||(i27.i3.u148.l2051<1))")||(X("((i1.u1.s0<1)||(i27.i3.u148.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i1.u1.s0<1)||(i27.i3.u148.l2051<1))" & X!"((i1.u1.s0<1)||(i27.i3.u148.l2051<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15646361414629385498
[2023-03-23 12:48:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15646361414629385498
Running compilation step : cd /tmp/ltsmin15646361414629385498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2926 ms.
Running link step : cd /tmp/ltsmin15646361414629385498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15646361414629385498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 130167 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 141 ms. Remains 618 /677 variables (removed 59) and now considering 1616/1764 (removed 148) transitions.
[2023-03-23 12:48:15] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2023-03-23 12:48:15] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-23 12:48:16] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-23 12:48:16] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 12:48:16] [INFO ] Invariant cache hit.
[2023-03-23 12:48:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 12:48:17] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2023-03-23 12:48:17] [INFO ] Flow matrix only has 1080 transitions (discarded 536 similar events)
[2023-03-23 12:48:17] [INFO ] Invariant cache hit.
[2023-03-23 12:48:18] [INFO ] Dead Transitions using invariants and state equation in 522 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 2443 ms. Remains : 618/677 places, 1616/1764 transitions.
Stuttering acceptance computed with spot in 185 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 847 ms.
Product exploration explored 100000 steps with 50000 reset in 844 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 100 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 4461 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 137 ms. Remains 605 /677 variables (removed 72) and now considering 1586/1764 (removed 178) transitions.
[2023-03-23 12:48:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-23 12:48:20] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 12:48:20] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-23 12:48:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 12:48:20] [INFO ] Invariant cache hit.
[2023-03-23 12:48:20] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 12:48:21] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-23 12:48:21] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 12:48:21] [INFO ] Invariant cache hit.
[2023-03-23 12:48:22] [INFO ] Dead Transitions using invariants and state equation in 505 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 2342 ms. Remains : 605/677 places, 1586/1764 transitions.
Stuttering acceptance computed with spot in 176 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 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-04 finished in 2538 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 410 ms. Remains 613 /677 variables (removed 64) and now considering 1602/1764 (removed 162) transitions.
[2023-03-23 12:48:23] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-23 12:48:23] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 12:48:23] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-23 12:48:23] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-23 12:48:23] [INFO ] Invariant cache hit.
[2023-03-23 12:48:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:48:25] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
[2023-03-23 12:48:25] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-23 12:48:25] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2023-03-23 12:48:25] [INFO ] Invariant cache hit.
[2023-03-23 12:48:26] [INFO ] Dead Transitions using invariants and state equation in 503 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 3339 ms. Remains : 613/677 places, 1602/1764 transitions.
Stuttering acceptance computed with spot in 29 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 38 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-08 finished in 3389 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 141 ms. Remains 607 /677 variables (removed 70) and now considering 1592/1764 (removed 172) transitions.
[2023-03-23 12:48:26] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-23 12:48:26] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 12:48:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-23 12:48:26] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-23 12:48:26] [INFO ] Invariant cache hit.
[2023-03-23 12:48:26] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-23 12:48:29] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
[2023-03-23 12:48:29] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-23 12:48:29] [INFO ] Invariant cache hit.
[2023-03-23 12:48:29] [INFO ] Dead Transitions using invariants and state equation in 532 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 3489 ms. Remains : 607/677 places, 1592/1764 transitions.
Stuttering acceptance computed with spot in 79 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]]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Stack based approach found an accepted trace after 541 steps with 0 reset with depth 542 and stack size 542 in 3 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-09 finished in 4039 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 141 ms. Remains 626 /677 variables (removed 51) and now considering 1636/1764 (removed 128) transitions.
[2023-03-23 12:48:30] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-23 12:48:30] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-23 12:48:30] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-23 12:48:30] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:48:30] [INFO ] Invariant cache hit.
[2023-03-23 12:48:30] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 12:48:32] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2023-03-23 12:48:32] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:48:32] [INFO ] Invariant cache hit.
[2023-03-23 12:48:32] [INFO ] Dead Transitions using invariants and state equation in 551 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 2717 ms. Remains : 626/677 places, 1636/1764 transitions.
Stuttering acceptance computed with spot in 370 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 637 ms.
Product exploration explored 100000 steps with 25000 reset in 667 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 206 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 337 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 233 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 157990 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157990 steps, saw 102566 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-23 12:48:38] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:48:38] [INFO ] Invariant cache hit.
[2023-03-23 12:48:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:39] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-23 12:48:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:40] [INFO ] After 979ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-23 12:48:40] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 12:48:41] [INFO ] After 1047ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-23 12:48:41] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 1 ms to minimize.
[2023-03-23 12:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-23 12:48:42] [INFO ] After 2118ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 591 ms.
[2023-03-23 12:48:43] [INFO ] After 3910ms 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 50 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.1 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 93 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 93 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 12:48:43] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-23 12:48:43] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 12:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:43] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 12:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:44] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 12:48:44] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:48:44] [INFO ] After 298ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 12:48:44] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-23 12:48:45] [INFO ] After 1559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 15 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 44 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 44 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) 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 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 :1
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 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 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:48:45] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:48:45] [INFO ] Invariant cache hit.
[2023-03-23 12:48:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:45] [INFO ] After 274ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-23 12:48:45] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:48:45] [INFO ] After 40ms SMT Verify possible using 81 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:48:45] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:48:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:46] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:46] [INFO ] After 127ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:46] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-23 12:48:46] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1246/1246 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 432 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 432 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 431 transition count 1238
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 431 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 430 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 430 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 429 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 429 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 428 transition count 1232
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 427 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 426 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 425 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 425 transition count 1226
Applied a total of 18 rules in 106 ms. Remains 425 /434 variables (removed 9) and now considering 1226/1246 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 425/434 places, 1226/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) 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 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 32 ms. (steps per millisecond=312 ) 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 219319 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219319 steps, saw 134498 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:48:50] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:48:50] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 12:48:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:50] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:48:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:48:50] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 12:48:50] [INFO ] After 138ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:51] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-23 12:48:51] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1226/1226 transitions.
Applied a total of 0 rules in 44 ms. Remains 425 /425 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 425/425 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1226/1226 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2023-03-23 12:48:51] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2023-03-23 12:48:51] [INFO ] Invariant cache hit.
[2023-03-23 12:48:51] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-23 12:48:51] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2023-03-23 12:48:51] [INFO ] Invariant cache hit.
[2023-03-23 12:48:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-23 12:48:52] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2023-03-23 12:48:52] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 12:48:52] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2023-03-23 12:48:52] [INFO ] Invariant cache hit.
[2023-03-23 12:48:53] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 425/425 places, 1226/1226 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 542 rules applied. Total rules applied 542 place count 425 transition count 684
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 553 place count 414 transition count 684
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 414 transition count 611
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 699 place count 341 transition count 611
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 2 with 256 rules applied. Total rules applied 955 place count 213 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 149 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 149 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 149 transition count 354
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 86 transition count 228
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 86 transition count 228
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 23 transition count 102
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 23 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 23 transition count 38
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 1401 place count 22 transition count 38
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 1403 place count 21 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1404 place count 21 transition count 36
Applied a total of 1404 rules in 23 ms. Remains 21 /425 variables (removed 404) and now considering 36/1226 (removed 1190) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 36 rows 21 cols
[2023-03-23 12:48:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 12:48:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:48:53] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:48:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 12:48:53] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:48:53] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:48:53] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 12:48:53] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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 (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 367 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 332 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 323 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 18 ms. Remains 626 /626 variables (removed 0) and now considering 1636/1636 (removed 0) transitions.
[2023-03-23 12:48:54] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
// Phase 1: matrix 1094 rows 626 cols
[2023-03-23 12:48:54] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 12:48:54] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-23 12:48:54] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:48:54] [INFO ] Invariant cache hit.
[2023-03-23 12:48:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 12:48:56] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2023-03-23 12:48:56] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:48:56] [INFO ] Invariant cache hit.
[2023-03-23 12:48:56] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2498 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 116 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 361 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 10005 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 177016 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 177016 steps, saw 114914 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 12:49:00] [INFO ] Flow matrix only has 1094 transitions (discarded 542 similar events)
[2023-03-23 12:49:00] [INFO ] Invariant cache hit.
[2023-03-23 12:49:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:01] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 12:49:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-23 12:49:02] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 12:49:02] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 12:49:02] [INFO ] After 829ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 12:49:03] [INFO ] After 1493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-23 12:49:04] [INFO ] After 2975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 49 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.1 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 90 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 90 ms. Remains : 434/626 places, 1246/1636 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 12:49:04] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
// Phase 1: matrix 709 rows 434 cols
[2023-03-23 12:49:04] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 12:49:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:04] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 12:49:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:05] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 12:49:05] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:49:05] [INFO ] After 481ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 12:49:06] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 1 ms to minimize.
[2023-03-23 12:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-23 12:49:06] [INFO ] After 1264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 428 ms.
[2023-03-23 12:49:07] [INFO ] After 2471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 73 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 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:49:07] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:49:07] [INFO ] Invariant cache hit.
[2023-03-23 12:49:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:07] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:49:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:49:08] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:08] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:49:08] [INFO ] After 232ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:08] [INFO ] After 494ms 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-23 12:49:08] [INFO ] After 1099ms 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 7 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 47 ms. Remains : 434/434 places, 1246/1246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 176960 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176960 steps, saw 108527 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:49:11] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:49:11] [INFO ] Invariant cache hit.
[2023-03-23 12:49:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:12] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:49:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:12] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:12] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:49:12] [INFO ] After 233ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:12] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-23 12:49:13] [INFO ] After 1095ms 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 3 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 43 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 43 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 43 ms. Remains 434 /434 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2023-03-23 12:49:13] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:49:13] [INFO ] Invariant cache hit.
[2023-03-23 12:49:13] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-23 12:49:13] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:49:13] [INFO ] Invariant cache hit.
[2023-03-23 12:49:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-23 12:49:14] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-23 12:49:14] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-23 12:49:14] [INFO ] Flow matrix only has 709 transitions (discarded 537 similar events)
[2023-03-23 12:49:14] [INFO ] Invariant cache hit.
[2023-03-23 12:49:14] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1677 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 27 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-23 12:49:14] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 12:49:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:49:14] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 12:49:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 12:49:14] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:49:14] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 12:49:14] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 12:49:15] [INFO ] After 73ms 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 232 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 296 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 282 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 292 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 609 ms.
Product exploration explored 100000 steps with 25000 reset in 618 ms.
Applying partial POR strategy [false, false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 322 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 192 ms. Remains 626 /626 variables (removed 0) and now considering 1630/1636 (removed 6) transitions.
[2023-03-23 12:49:17] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 12:49:17] [INFO ] Flow matrix only has 1091 transitions (discarded 539 similar events)
// Phase 1: matrix 1091 rows 626 cols
[2023-03-23 12:49:17] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 12:49:18] [INFO ] Dead Transitions using invariants and state equation in 685 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 926 ms. Remains : 626/626 places, 1630/1636 transitions.
Built C files in :
/tmp/ltsmin1253843145495586556
[2023-03-23 12:49:18] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1253843145495586556
Running compilation step : cd /tmp/ltsmin1253843145495586556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2897 ms.
Running link step : cd /tmp/ltsmin1253843145495586556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1253843145495586556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8861392226502283930.hoa' '--buchi-type=spotba'
LTSmin run took 390 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c016-LTLFireability-10 finished in 51950 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 155 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-23 12:49:22] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:49:22] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-23 12:49:22] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-23 12:49:22] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:22] [INFO ] Invariant cache hit.
[2023-03-23 12:49:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:24] [INFO ] Implicit Places using invariants and state equation in 1773 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2023-03-23 12:49:24] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:24] [INFO ] Invariant cache hit.
[2023-03-23 12:49:24] [INFO ] Dead Transitions using invariants and state equation in 524 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 2905 ms. Remains : 615/677 places, 1612/1764 transitions.
Stuttering acceptance computed with spot in 136 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 33331 reset in 668 ms.
Product exploration explored 100000 steps with 33202 reset in 666 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 338 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 93 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) 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
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 201374 steps, run timeout after 3012 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 201374 steps, saw 130723 distinct states, run finished after 3013 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:49:30] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:30] [INFO ] Invariant cache hit.
[2023-03-23 12:49:30] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:49:30] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:31] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:31] [INFO ] After 390ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:31] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 6 ms to minimize.
[2023-03-23 12:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-23 12:49:32] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-23 12:49:32] [INFO ] After 1966ms 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, 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 158 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 170 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) 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 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
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 250890 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250890 steps, saw 162858 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:49:35] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-23 12:49:35] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 12:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:36] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:37] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:37] [INFO ] After 393ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:37] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-23 12:49:38] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-23 12:49:38] [INFO ] After 1756ms 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 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 75 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:49:38] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:38] [INFO ] Invariant cache hit.
[2023-03-23 12:49:38] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-23 12:49:38] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:38] [INFO ] Invariant cache hit.
[2023-03-23 12:49:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:40] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2023-03-23 12:49:40] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-23 12:49:40] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:40] [INFO ] Invariant cache hit.
[2023-03-23 12:49:41] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2742 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 36 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-23 12:49:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 12:49:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:49:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:41] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 12:49:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:49:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:41] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:49:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:41] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:41] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:41] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 12:49:41] [INFO ] After 67ms 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 257 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 94 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 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-23 12:49:41] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:49:41] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 12:49:42] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-23 12:49:42] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:42] [INFO ] Invariant cache hit.
[2023-03-23 12:49:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:44] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2023-03-23 12:49:44] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:44] [INFO ] Invariant cache hit.
[2023-03-23 12:49:44] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2775 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 260 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 10012 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) 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 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 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 197231 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197231 steps, saw 128033 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:49:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:49:48] [INFO ] Invariant cache hit.
[2023-03-23 12:49:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:48] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:49:49] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:49] [INFO ] After 389ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:49] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-23 12:49:50] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-23 12:49:50] [INFO ] After 1930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 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 150 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 150 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 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 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 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 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 235917 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235917 steps, saw 153141 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:49:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-23 12:49:53] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 12:49:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:54] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:49:55] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:55] [INFO ] After 412ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:55] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-23 12:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-23 12:49:56] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-23 12:49:56] [INFO ] After 1797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 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 70 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 70 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 68 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:49:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:56] [INFO ] Invariant cache hit.
[2023-03-23 12:49:56] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-23 12:49:56] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:56] [INFO ] Invariant cache hit.
[2023-03-23 12:49:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:49:58] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-23 12:49:58] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 12:49:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:49:58] [INFO ] Invariant cache hit.
[2023-03-23 12:49:58] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2636 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 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 31 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-23 12:49:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:49:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:49:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:49:59] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 12:49:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:49:59] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:49:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:49:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:49:59] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:59] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:49:59] [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 9 ms.
[2023-03-23 12:49:59] [INFO ] After 71ms 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 257 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 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33347 reset in 647 ms.
Product exploration explored 100000 steps with 33334 reset in 658 ms.
Built C files in :
/tmp/ltsmin9383608392369957373
[2023-03-23 12:50:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9383608392369957373
Running compilation step : cd /tmp/ltsmin9383608392369957373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2803 ms.
Running link step : cd /tmp/ltsmin9383608392369957373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9383608392369957373;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13604010384065828606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-23 12:50:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:50:16] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 12:50:16] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-23 12:50:16] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:50:16] [INFO ] Invariant cache hit.
[2023-03-23 12:50:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:50:18] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-23 12:50:18] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:50:18] [INFO ] Invariant cache hit.
[2023-03-23 12:50:18] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2391 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin9158072482205844002
[2023-03-23 12:50:18] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9158072482205844002
Running compilation step : cd /tmp/ltsmin9158072482205844002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9158072482205844002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9158072482205844002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 12:50:21] [INFO ] Flatten gal took : 45 ms
[2023-03-23 12:50:21] [INFO ] Flatten gal took : 45 ms
[2023-03-23 12:50:21] [INFO ] Time to serialize gal into /tmp/LTL727899741018887169.gal : 7 ms
[2023-03-23 12:50:21] [INFO ] Time to serialize properties into /tmp/LTL452360108904930948.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL727899741018887169.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6866697791380415952.hoa' '-atoms' '/tmp/LTL452360108904930948.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL452360108904930948.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6866697791380415952.hoa
Detected timeout of ITS tools.
[2023-03-23 12:50:37] [INFO ] Flatten gal took : 41 ms
[2023-03-23 12:50:37] [INFO ] Flatten gal took : 35 ms
[2023-03-23 12:50:37] [INFO ] Time to serialize gal into /tmp/LTL17621272422124214709.gal : 5 ms
[2023-03-23 12:50:37] [INFO ] Time to serialize properties into /tmp/LTL4800359153776882640.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17621272422124214709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4800359153776882640.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2023-03-23 12:50:52] [INFO ] Flatten gal took : 38 ms
[2023-03-23 12:50:52] [INFO ] Applying decomposition
[2023-03-23 12:50:52] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12089815703095993140.txt' '-o' '/tmp/graph12089815703095993140.bin' '-w' '/tmp/graph12089815703095993140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12089815703095993140.bin' '-l' '-1' '-v' '-w' '/tmp/graph12089815703095993140.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:50:52] [INFO ] Decomposing Gal with order
[2023-03-23 12:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:50:52] [INFO ] Removed a total of 2686 redundant transitions.
[2023-03-23 12:50:52] [INFO ] Flatten gal took : 81 ms
[2023-03-23 12:50:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1226 labels/synchronizations in 53 ms.
[2023-03-23 12:50:52] [INFO ] Time to serialize gal into /tmp/LTL8734966201911432990.gal : 8 ms
[2023-03-23 12:50:52] [INFO ] Time to serialize properties into /tmp/LTL14773014067605791556.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8734966201911432990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14773014067605791556.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((i1.u1.s0<1)||(i24.i2.u151.l2128<1))")||(G("((i1.u1.s0<1)||(i22.u98.l753<1))"))))&&("((i1.u1.s0<1)||(i22.u98.l753<1))")))...157
Formula 0 simplified : FG(!"((i1.u1.s0<1)||(i22.u98.l753<1))" | X(!"((i1.u1.s0<1)||(i24.i2.u151.l2128<1))" & F!"((i1.u1.s0<1)||(i22.u98.l753<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15486211236325527806
[2023-03-23 12:51:07] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15486211236325527806
Running compilation step : cd /tmp/ltsmin15486211236325527806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2875 ms.
Running link step : cd /tmp/ltsmin15486211236325527806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15486211236325527806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 120571 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 285 ms. Remains 605 /677 variables (removed 72) and now considering 1584/1764 (removed 180) transitions.
[2023-03-23 12:51:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-23 12:51:22] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-23 12:51:23] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-23 12:51:23] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-23 12:51:23] [INFO ] Invariant cache hit.
[2023-03-23 12:51:23] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 12:51:24] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
[2023-03-23 12:51:24] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-23 12:51:24] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-23 12:51:24] [INFO ] Invariant cache hit.
[2023-03-23 12:51:25] [INFO ] Dead Transitions using invariants and state equation in 508 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 2628 ms. Remains : 605/677 places, 1584/1764 transitions.
Stuttering acceptance computed with spot in 34 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 0 reset in 452 ms.
Stuttering criterion allowed to conclude after 234 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLFireability-14 finished in 3139 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 136 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-23 12:51:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:51:25] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 12:51:26] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-23 12:51:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:26] [INFO ] Invariant cache hit.
[2023-03-23 12:51:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:28] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
[2023-03-23 12:51:28] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:28] [INFO ] Invariant cache hit.
[2023-03-23 12:51:28] [INFO ] Dead Transitions using invariants and state equation in 511 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 2851 ms. Remains : 614/677 places, 1608/1764 transitions.
Stuttering acceptance computed with spot in 71 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 760 ms.
Product exploration explored 100000 steps with 50000 reset in 769 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 139 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 4619 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 147 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 171 ms. Remains 614 /677 variables (removed 63) and now considering 1608/1764 (removed 156) transitions.
[2023-03-23 12:51:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:51:30] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 12:51:31] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-23 12:51:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:31] [INFO ] Invariant cache hit.
[2023-03-23 12:51:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:32] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
[2023-03-23 12:51:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:32] [INFO ] Invariant cache hit.
[2023-03-23 12:51:33] [INFO ] Dead Transitions using invariants and state equation in 535 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 2617 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 2 reset in 401 ms.
Product exploration explored 100000 steps with 1 reset in 570 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 83 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 146 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 67 ms. (steps per millisecond=149 ) 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 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 15 ms. (steps per millisecond=666 ) 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 194221 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194221 steps, saw 126079 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 12:51:37] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:37] [INFO ] Invariant cache hit.
[2023-03-23 12:51:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:51:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:38] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-23 12:51:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 12:51:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:38] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-23 12:51:38] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:39] [INFO ] After 300ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-23 12:51:39] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 10 ms to minimize.
[2023-03-23 12:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-23 12:51:39] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-23 12:51:39] [INFO ] After 1538ms 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 31 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 157 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 158 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 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 237494 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237494 steps, saw 154165 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:51:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 12:51:43] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-23 12:51:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:51:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:43] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:51:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:51:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:44] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:51:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:44] [INFO ] After 317ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:51:44] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-23 12:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-23 12:51:45] [INFO ] After 755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-23 12:51:45] [INFO ] After 1543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 0 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 76 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 76 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 86 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 12:51:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:51:45] [INFO ] Invariant cache hit.
[2023-03-23 12:51:45] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-23 12:51:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:51:45] [INFO ] Invariant cache hit.
[2023-03-23 12:51:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:47] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2023-03-23 12:51:47] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 12:51:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:51:47] [INFO ] Invariant cache hit.
[2023-03-23 12:51:48] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2855 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 29 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-23 12:51:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:51:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:51:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:51:48] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-23 12:51:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:51:48] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:51:48] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:51:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 12:51:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:48] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:51:48] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:51:48] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-23 12:51:48] [INFO ] After 68ms 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 122 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 160 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 145 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-23 12:51:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:51:48] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 12:51:49] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-23 12:51:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:49] [INFO ] Invariant cache hit.
[2023-03-23 12:51:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:51] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2023-03-23 12:51:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:51] [INFO ] Invariant cache hit.
[2023-03-23 12:51:51] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2750 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 90 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 184 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10011 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=145 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 238251 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238251 steps, saw 154656 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 12:51:54] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:51:54] [INFO ] Invariant cache hit.
[2023-03-23 12:51:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:51:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:51:55] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:51:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:51:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:51:56] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:51:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:51:56] [INFO ] After 220ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:51:56] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-23 12:51:56] [INFO ] After 1175ms 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, 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 153 ms. Remains : 614/614 places, 1604/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273152 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273152 steps, saw 177307 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 12:51:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 12:51:59] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 12:52:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:52:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:52:00] [INFO ] After 533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:52:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 12:52:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:52:01] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:52:01] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:52:01] [INFO ] After 203ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:52:01] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-23 12:52:01] [INFO ] After 1114ms 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, 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 76 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 12:52:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:52:01] [INFO ] Invariant cache hit.
[2023-03-23 12:52:02] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-23 12:52:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:52:02] [INFO ] Invariant cache hit.
[2023-03-23 12:52:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:52:03] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2023-03-23 12:52:03] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-23 12:52:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 12:52:03] [INFO ] Invariant cache hit.
[2023-03-23 12:52:04] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2541 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 26 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-23 12:52:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:52:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 12:52:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:52:04] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 12:52:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:52:04] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:52:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 12:52:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:52:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:52:04] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 12:52:04] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 12:52:04] [INFO ] After 10ms 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-23 12:52:04] [INFO ] After 53ms 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 76 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 168 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 179 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 178 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 423 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Built C files in :
/tmp/ltsmin9229744935458917197
[2023-03-23 12:52:06] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9229744935458917197
Running compilation step : cd /tmp/ltsmin9229744935458917197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2958 ms.
Running link step : cd /tmp/ltsmin9229744935458917197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9229744935458917197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11867275172757195337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 17 ms. Remains 614 /614 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:52:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2023-03-23 12:52:21] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 12:52:21] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-23 12:52:21] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:52:21] [INFO ] Invariant cache hit.
[2023-03-23 12:52:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:52:23] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2023-03-23 12:52:23] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:52:23] [INFO ] Invariant cache hit.
[2023-03-23 12:52:23] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2380 ms. Remains : 614/614 places, 1608/1608 transitions.
Built C files in :
/tmp/ltsmin14234908303374473546
[2023-03-23 12:52:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14234908303374473546
Running compilation step : cd /tmp/ltsmin14234908303374473546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2744 ms.
Running link step : cd /tmp/ltsmin14234908303374473546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14234908303374473546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16199513640518467570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 12:52:38] [INFO ] Flatten gal took : 47 ms
[2023-03-23 12:52:38] [INFO ] Flatten gal took : 35 ms
[2023-03-23 12:52:38] [INFO ] Time to serialize gal into /tmp/LTL9822010755046410014.gal : 6 ms
[2023-03-23 12:52:38] [INFO ] Time to serialize properties into /tmp/LTL9804975312689795735.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9822010755046410014.gal' '-t' 'CGAL' '-hoa' '/tmp/aut111505360570114923.hoa' '-atoms' '/tmp/LTL9804975312689795735.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL9804975312689795735.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut111505360570114923.hoa
Detected timeout of ITS tools.
[2023-03-23 12:52:53] [INFO ] Flatten gal took : 32 ms
[2023-03-23 12:52:53] [INFO ] Flatten gal took : 33 ms
[2023-03-23 12:52:53] [INFO ] Time to serialize gal into /tmp/LTL1401815442290486164.gal : 5 ms
[2023-03-23 12:52:53] [INFO ] Time to serialize properties into /tmp/LTL2784800124305035834.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1401815442290486164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2784800124305035834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
Detected timeout of ITS tools.
[2023-03-23 12:53:08] [INFO ] Flatten gal took : 35 ms
[2023-03-23 12:53:08] [INFO ] Applying decomposition
[2023-03-23 12:53:08] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9123913456918790428.txt' '-o' '/tmp/graph9123913456918790428.bin' '-w' '/tmp/graph9123913456918790428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9123913456918790428.bin' '-l' '-1' '-v' '-w' '/tmp/graph9123913456918790428.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:53:09] [INFO ] Decomposing Gal with order
[2023-03-23 12:53:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:53:09] [INFO ] Removed a total of 2666 redundant transitions.
[2023-03-23 12:53:09] [INFO ] Flatten gal took : 68 ms
[2023-03-23 12:53:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1145 labels/synchronizations in 52 ms.
[2023-03-23 12:53:09] [INFO ] Time to serialize gal into /tmp/LTL15088123864941990927.gal : 9 ms
[2023-03-23 12:53:09] [INFO ] Time to serialize properties into /tmp/LTL6964723949775292598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15088123864941990927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6964723949775292598.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i1.u2.s0<1)||(i27.i2.u148.l2051<1))")||(X("((i1.u2.s0<1)||(i27.i2.u148.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i1.u2.s0<1)||(i27.i2.u148.l2051<1))" & X!"((i1.u2.s0<1)||(i27.i2.u148.l2051<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14492743463473343550
[2023-03-23 12:53:24] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14492743463473343550
Running compilation step : cd /tmp/ltsmin14492743463473343550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2770 ms.
Running link step : cd /tmp/ltsmin14492743463473343550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14492743463473343550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-02 finished in 129041 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))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c016-LTLFireability-12
Stuttering acceptance computed with spot in 129 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 150 ms. Remains 615 /677 variables (removed 62) and now considering 1612/1764 (removed 152) transitions.
[2023-03-23 12:53:39] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:53:39] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 12:53:40] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-23 12:53:40] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:53:40] [INFO ] Invariant cache hit.
[2023-03-23 12:53:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:53:41] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2023-03-23 12:53:41] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:53:41] [INFO ] Invariant cache hit.
[2023-03-23 12:53:42] [INFO ] Dead Transitions using invariants and state equation in 510 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 2451 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 33324 reset in 672 ms.
Product exploration explored 100000 steps with 33419 reset in 673 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 285 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 152 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) 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 226271 steps, run timeout after 3008 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226271 steps, saw 146882 distinct states, run finished after 3008 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:53:47] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:53:47] [INFO ] Invariant cache hit.
[2023-03-23 12:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 12:53:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:53:47] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:53:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:53:48] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:53:48] [INFO ] After 406ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:48] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 0 ms to minimize.
[2023-03-23 12:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-23 12:53:49] [INFO ] After 995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-23 12:53:49] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 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 143 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 143 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) 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 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 178117 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178117 steps, saw 115629 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:53:52] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-23 12:53:52] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-23 12:53:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:53:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:53:53] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:53:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:53:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:53:54] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:53:54] [INFO ] After 395ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:54] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-23 12:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-23 12:53:54] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-23 12:53:55] [INFO ] After 1752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 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 70 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 71 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 81 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:53:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:53:55] [INFO ] Invariant cache hit.
[2023-03-23 12:53:55] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-23 12:53:55] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:53:55] [INFO ] Invariant cache hit.
[2023-03-23 12:53:55] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:53:57] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2023-03-23 12:53:57] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 12:53:57] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:53:57] [INFO ] Invariant cache hit.
[2023-03-23 12:53:57] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2367 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 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-23 12:53:57] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 12:53:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 12:53:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:53:57] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 12:53:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:53:57] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:53:57] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:53:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:53:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:53:57] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:57] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:53:57] [INFO ] After 14ms 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-23 12:53:57] [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 275 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 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 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 19 ms. Remains 615 /615 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-23 12:53:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:53:58] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 12:53:58] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-23 12:53:58] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:53:58] [INFO ] Invariant cache hit.
[2023-03-23 12:53:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:54:00] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
[2023-03-23 12:54:00] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:54:00] [INFO ] Invariant cache hit.
[2023-03-23 12:54:01] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2726 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 298 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 103 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) 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 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 215297 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215297 steps, saw 139759 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:54:04] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:54:04] [INFO ] Invariant cache hit.
[2023-03-23 12:54:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:54:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:54:05] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:54:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 12:54:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:54:05] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:05] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:54:06] [INFO ] After 391ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:06] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2023-03-23 12:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-23 12:54:06] [INFO ] After 993ms 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-23 12:54:07] [INFO ] After 1979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 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 146 ms. Remains : 615/615 places, 1608/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) 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 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 175968 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175968 steps, saw 114235 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:54:10] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-23 12:54:10] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-23 12:54:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:54:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:54:11] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:54:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 12:54:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:54:11] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:54:12] [INFO ] After 406ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:12] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:54:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-23 12:54:12] [INFO ] After 899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-23 12:54:12] [INFO ] After 1759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 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 72 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 72 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 78 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-23 12:54:12] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:54:12] [INFO ] Invariant cache hit.
[2023-03-23 12:54:13] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-23 12:54:13] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:54:13] [INFO ] Invariant cache hit.
[2023-03-23 12:54:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:54:15] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-23 12:54:15] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 12:54:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-23 12:54:15] [INFO ] Invariant cache hit.
[2023-03-23 12:54:15] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2885 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 30 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-23 12:54:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 12:54:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:54:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:54:15] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 12:54:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 12:54:15] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:54:15] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:54:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 12:54:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:54:15] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:15] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:54:15] [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 7 ms.
[2023-03-23 12:54:15] [INFO ] After 72ms 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 325 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 140 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33196 reset in 664 ms.
Product exploration explored 100000 steps with 33207 reset in 671 ms.
Built C files in :
/tmp/ltsmin9237612697813146868
[2023-03-23 12:54:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9237612697813146868
Running compilation step : cd /tmp/ltsmin9237612697813146868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9237612697813146868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9237612697813146868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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-23 12:54:21] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2023-03-23 12:54:21] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 12:54:21] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-23 12:54:21] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:54:21] [INFO ] Invariant cache hit.
[2023-03-23 12:54:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 12:54:23] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2023-03-23 12:54:23] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2023-03-23 12:54:23] [INFO ] Invariant cache hit.
[2023-03-23 12:54:23] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2413 ms. Remains : 615/615 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin16339891041738433716
[2023-03-23 12:54:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16339891041738433716
Running compilation step : cd /tmp/ltsmin16339891041738433716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16339891041738433716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16339891041738433716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 12:54:26] [INFO ] Flatten gal took : 38 ms
[2023-03-23 12:54:26] [INFO ] Flatten gal took : 39 ms
[2023-03-23 12:54:26] [INFO ] Time to serialize gal into /tmp/LTL82100152049958194.gal : 7 ms
[2023-03-23 12:54:26] [INFO ] Time to serialize properties into /tmp/LTL2312730250334802897.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL82100152049958194.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9452421001936633594.hoa' '-atoms' '/tmp/LTL2312730250334802897.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL2312730250334802897.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9452421001936633594.hoa
Detected timeout of ITS tools.
[2023-03-23 12:54:41] [INFO ] Flatten gal took : 37 ms
[2023-03-23 12:54:41] [INFO ] Flatten gal took : 41 ms
[2023-03-23 12:54:41] [INFO ] Time to serialize gal into /tmp/LTL3850776294137032879.gal : 6 ms
[2023-03-23 12:54:41] [INFO ] Time to serialize properties into /tmp/LTL15273459715580683878.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3850776294137032879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15273459715580683878.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((s0<1)||(l2128<1))")||(G("((s0<1)||(l753<1))"))))&&("((s0<1)||(l753<1))")))))
Formula 0 simplified : FG(!"((s0<1)||(l753<1))" | X(!"((s0<1)||(l2128<1))" & F!"((s0<1)||(l753<1))"))
Detected timeout of ITS tools.
[2023-03-23 12:54:56] [INFO ] Flatten gal took : 40 ms
[2023-03-23 12:54:56] [INFO ] Applying decomposition
[2023-03-23 12:54:56] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10411804344802639033.txt' '-o' '/tmp/graph10411804344802639033.bin' '-w' '/tmp/graph10411804344802639033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10411804344802639033.bin' '-l' '-1' '-v' '-w' '/tmp/graph10411804344802639033.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:54:57] [INFO ] Decomposing Gal with order
[2023-03-23 12:54:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:54:57] [INFO ] Removed a total of 2684 redundant transitions.
[2023-03-23 12:54:57] [INFO ] Flatten gal took : 79 ms
[2023-03-23 12:54:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1213 labels/synchronizations in 36 ms.
[2023-03-23 12:54:57] [INFO ] Time to serialize gal into /tmp/LTL9142718214200631825.gal : 24 ms
[2023-03-23 12:54:57] [INFO ] Time to serialize properties into /tmp/LTL10597356397889278885.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9142718214200631825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10597356397889278885.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X(("((i0.u0.s0<1)||(i27.i2.u147.l2128<1))")||(G("((i0.u0.s0<1)||(i5.i1.u66.l753<1))"))))&&("((i0.u0.s0<1)||(i5.i1.u66.l753<1))...161
Formula 0 simplified : FG(!"((i0.u0.s0<1)||(i5.i1.u66.l753<1))" | X(!"((i0.u0.s0<1)||(i27.i2.u147.l2128<1))" & F!"((i0.u0.s0<1)||(i5.i1.u66.l753<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1377086754161052
[2023-03-23 12:55:12] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1377086754161052
Running compilation step : cd /tmp/ltsmin1377086754161052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2960 ms.
Running link step : cd /tmp/ltsmin1377086754161052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1377086754161052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLFireability-12 finished in 108103 ms.
[2023-03-23 12:55:27] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14542445354507740459
[2023-03-23 12:55:27] [INFO ] Too many transitions (1764) to apply POR reductions. Disabling POR matrices.
[2023-03-23 12:55:27] [INFO ] Applying decomposition
[2023-03-23 12:55:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14542445354507740459
Running compilation step : cd /tmp/ltsmin14542445354507740459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 12:55:27] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3034266600175864464.txt' '-o' '/tmp/graph3034266600175864464.bin' '-w' '/tmp/graph3034266600175864464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3034266600175864464.bin' '-l' '-1' '-v' '-w' '/tmp/graph3034266600175864464.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:55:27] [INFO ] Decomposing Gal with order
[2023-03-23 12:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:55:27] [INFO ] Removed a total of 2953 redundant transitions.
[2023-03-23 12:55:27] [INFO ] Flatten gal took : 69 ms
[2023-03-23 12:55:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 1399 labels/synchronizations in 42 ms.
[2023-03-23 12:55:27] [INFO ] Time to serialize gal into /tmp/LTLFireability11122344711502707891.gal : 9 ms
[2023-03-23 12:55:27] [INFO ] Time to serialize properties into /tmp/LTLFireability13693908122971890256.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11122344711502707891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13693908122971890256.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("((i0.u1.s0<1)||(i24.i4.u174.l2051<1))")||(X("((i0.u1.s0<1)||(i24.i4.u174.l2051<1))")))))))
Formula 0 simplified : XXF(!"((i0.u1.s0<1)||(i24.i4.u174.l2051<1))" & X!"((i0.u1.s0<1)||(i24.i4.u174.l2051<1))")
Compilation finished in 3500 ms.
Running link step : cd /tmp/ltsmin14542445354507740459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14542445354507740459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 13:18:50] [INFO ] Flatten gal took : 77 ms
[2023-03-23 13:18:50] [INFO ] Time to serialize gal into /tmp/LTLFireability5541457397634317505.gal : 6 ms
[2023-03-23 13:18:50] [INFO ] Time to serialize properties into /tmp/LTLFireability9669357555074160547.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5541457397634317505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9669357555074160547.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: LTL layer: formula: X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.012: "X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: buchi has 5 states
pins2lts-mc-linux64( 0/ 8), 0.049: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.773: DFS-FIFO for weak LTL, using special progress label 1769
pins2lts-mc-linux64( 0/ 8), 0.773: There are 1770 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.773: State length is 678, there are 1772 groups
pins2lts-mc-linux64( 0/ 8), 0.773: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.773: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.773: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.773: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.586: ~1 levels ~960 states ~5632 transitions
pins2lts-mc-linux64( 6/ 8), 1.995: ~1 levels ~1920 states ~11104 transitions
pins2lts-mc-linux64( 6/ 8), 2.188: ~1 levels ~3840 states ~23952 transitions
pins2lts-mc-linux64( 2/ 8), 2.559: ~1 levels ~7680 states ~45592 transitions
pins2lts-mc-linux64( 2/ 8), 3.206: ~1 levels ~15360 states ~98128 transitions
pins2lts-mc-linux64( 2/ 8), 4.378: ~1 levels ~30720 states ~191640 transitions
pins2lts-mc-linux64( 2/ 8), 6.518: ~1 levels ~61440 states ~389168 transitions
pins2lts-mc-linux64( 4/ 8), 10.902: ~1 levels ~122880 states ~662088 transitions
pins2lts-mc-linux64( 4/ 8), 19.015: ~1 levels ~245760 states ~1360384 transitions
pins2lts-mc-linux64( 4/ 8), 34.473: ~1 levels ~491520 states ~2636744 transitions
pins2lts-mc-linux64( 4/ 8), 65.324: ~1 levels ~983040 states ~5282936 transitions
pins2lts-mc-linux64( 4/ 8), 127.689: ~1 levels ~1966080 states ~11216152 transitions
pins2lts-mc-linux64( 4/ 8), 256.513: ~1 levels ~3932160 states ~22496336 transitions
pins2lts-mc-linux64( 2/ 8), 567.455: ~1 levels ~7864320 states ~51626464 transitions
pins2lts-mc-linux64( 4/ 8), 1100.675: ~1 levels ~15728640 states ~97616752 transitions
pins2lts-mc-linux64( 0/ 8), 1679.683: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1679.726:
pins2lts-mc-linux64( 0/ 8), 1679.726: mean standard work distribution: 11.1% (states) 12.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1679.726:
pins2lts-mc-linux64( 0/ 8), 1679.726: Explored 22293590 states 183861092 transitions, fanout: 8.247
pins2lts-mc-linux64( 0/ 8), 1679.726: Total exploration time 1678.920 sec (1678.870 sec minimum, 1678.901 sec on average)
pins2lts-mc-linux64( 0/ 8), 1679.726: States per second: 13279, Transitions per second: 109512
pins2lts-mc-linux64( 0/ 8), 1679.726:
pins2lts-mc-linux64( 0/ 8), 1679.726: Progress states detected: 47439804
pins2lts-mc-linux64( 0/ 8), 1679.726: Redundant explorations: -53.0067
pins2lts-mc-linux64( 0/ 8), 1679.726:
pins2lts-mc-linux64( 0/ 8), 1679.726: Queue width: 8B, total height: 39866433, memory: 304.16MB
pins2lts-mc-linux64( 0/ 8), 1679.726: Tree memory: 617.9MB, 13.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1679.726: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1679.726: Stored 1788 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1679.726: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1679.726: Est. total memory use: 922.1MB (~1328.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14542445354507740459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14542445354507740459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp1==true))||(LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 13:42:22] [INFO ] Flatten gal took : 248 ms
[2023-03-23 13:42:25] [INFO ] Input system was already deterministic with 1764 transitions.
[2023-03-23 13:42:25] [INFO ] Transformed 677 places.
[2023-03-23 13:42:25] [INFO ] Transformed 1764 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 13:42:25] [INFO ] Time to serialize gal into /tmp/LTLFireability2944002363748205887.gal : 10 ms
[2023-03-23 13:42:25] [INFO ] Time to serialize properties into /tmp/LTLFireability5281377039326064003.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2944002363748205887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5281377039326064003.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("((s0<1)||(l2051<1))")||(X("((s0<1)||(l2051<1))")))))))
Formula 0 simplified : XXF(!"((s0<1)||(l2051<1))" & X!"((s0<1)||(l2051<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13070288 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15925236 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r165-tall-167838850800740"
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 ;