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.r167-tall-167838853500724.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 lolaxred
Input is FunctionPointer-PT-c004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 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-c004-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678512433995

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 05:27:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 05:27:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:27:15] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2023-03-11 05:27:15] [INFO ] Transformed 2826 places.
[2023-03-11 05:27:15] [INFO ] Transformed 8960 transitions.
[2023-03-11 05:27:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 289 places :
Symmetric choice reduction at 1 with 289 rule applications. Total rules 306 place count 1322 transition count 3822
Iterating global reduction 1 with 289 rules applied. Total rules applied 595 place count 1322 transition count 3822
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 438 transitions.
Iterating post reduction 1 with 438 rules applied. Total rules applied 1033 place count 1322 transition count 3384
Discarding 148 places :
Symmetric choice reduction at 2 with 148 rule applications. Total rules 1181 place count 1174 transition count 3088
Iterating global reduction 2 with 148 rules applied. Total rules applied 1329 place count 1174 transition count 3088
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 1429 place count 1174 transition count 2988
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1443 place count 1160 transition count 2960
Iterating global reduction 3 with 14 rules applied. Total rules applied 1457 place count 1160 transition count 2960
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1471 place count 1146 transition count 2932
Iterating global reduction 3 with 14 rules applied. Total rules applied 1485 place count 1146 transition count 2932
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1499 place count 1132 transition count 2904
Iterating global reduction 3 with 14 rules applied. Total rules applied 1513 place count 1132 transition count 2904
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1527 place count 1118 transition count 2876
Iterating global reduction 3 with 14 rules applied. Total rules applied 1541 place count 1118 transition count 2876
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1555 place count 1104 transition count 2848
Iterating global reduction 3 with 14 rules applied. Total rules applied 1569 place count 1104 transition count 2848
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1581 place count 1092 transition count 2824
Iterating global reduction 3 with 12 rules applied. Total rules applied 1593 place count 1092 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1604 place count 1081 transition count 2802
Iterating global reduction 3 with 11 rules applied. Total rules applied 1615 place count 1081 transition count 2802
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1654 place count 1042 transition count 2658
Iterating global reduction 3 with 39 rules applied. Total rules applied 1693 place count 1042 transition count 2658
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1741 place count 994 transition count 2466
Iterating global reduction 3 with 48 rules applied. Total rules applied 1789 place count 994 transition count 2466
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1837 place count 946 transition count 2340
Iterating global reduction 3 with 48 rules applied. Total rules applied 1885 place count 946 transition count 2340
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1933 place count 898 transition count 2244
Iterating global reduction 3 with 48 rules applied. Total rules applied 1981 place count 898 transition count 2244
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2029 place count 850 transition count 2148
Iterating global reduction 3 with 48 rules applied. Total rules applied 2077 place count 850 transition count 2148
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2125 place count 802 transition count 2052
Iterating global reduction 3 with 48 rules applied. Total rules applied 2173 place count 802 transition count 2052
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2220 place count 755 transition count 1958
Iterating global reduction 3 with 47 rules applied. Total rules applied 2267 place count 755 transition count 1958
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2282 place count 740 transition count 1928
Iterating global reduction 3 with 15 rules applied. Total rules applied 2297 place count 740 transition count 1928
Applied a total of 2297 rules in 1449 ms. Remains 740 /1628 variables (removed 888) and now considering 1928/5962 (removed 4034) transitions.
[2023-03-11 05:27:17] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
// Phase 1: matrix 1291 rows 740 cols
[2023-03-11 05:27:17] [INFO ] Computed 2 place invariants in 34 ms
[2023-03-11 05:27:18] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-11 05:27:18] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-11 05:27:18] [INFO ] Invariant cache hit.
[2023-03-11 05:27:18] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-11 05:27:20] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
[2023-03-11 05:27:20] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-11 05:27:20] [INFO ] Invariant cache hit.
[2023-03-11 05:27:20] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 740/1628 places, 1928/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4577 ms. Remains : 740/1628 places, 1928/5962 transitions.
Support contains 22 out of 740 places after structural reductions.
[2023-03-11 05:27:21] [INFO ] Flatten gal took : 142 ms
[2023-03-11 05:27:21] [INFO ] Flatten gal took : 92 ms
[2023-03-11 05:27:21] [INFO ] Input system was already deterministic with 1928 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-11 05:27:21] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-11 05:27:21] [INFO ] Invariant cache hit.
[2023-03-11 05:27:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 05:27:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:27:22] [INFO ] After 924ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-11 05:27:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:27:25] [INFO ] After 2350ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-11 05:27:25] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-11 05:27:27] [INFO ] After 2058ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :1 sat :17
[2023-03-11 05:27:28] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 4 ms to minimize.
[2023-03-11 05:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-11 05:27:29] [INFO ] After 4122ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 1454 ms.
[2023-03-11 05:27:31] [INFO ] After 8424ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 21 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 740 transition count 1896
Applied a total of 32 rules in 424 ms. Remains 740 /740 variables (removed 0) and now considering 1896/1928 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 740/740 places, 1896/1928 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
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 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
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 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
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
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-11 05:27:32] [INFO ] Flow matrix only has 1275 transitions (discarded 621 similar events)
// Phase 1: matrix 1275 rows 740 cols
[2023-03-11 05:27:32] [INFO ] Computed 2 place invariants in 33 ms
[2023-03-11 05:27:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 05:27:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 05:27:33] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 05:27:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:27:35] [INFO ] After 2175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-11 05:27:35] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-11 05:27:37] [INFO ] After 1803ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-11 05:27:37] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 2 ms to minimize.
[2023-03-11 05:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-11 05:27:38] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 2 ms to minimize.
[2023-03-11 05:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-11 05:27:39] [INFO ] After 3606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 891 ms.
[2023-03-11 05:27:40] [INFO ] After 7098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 27 ms.
Support contains 19 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1896/1896 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 739 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 739 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 738 transition count 1892
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 738 transition count 1892
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 737 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 737 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 736 transition count 1886
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 736 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 735 transition count 1884
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 735 transition count 1884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 734 transition count 1882
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 734 transition count 1882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 733 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 733 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 732 transition count 1878
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 732 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 731 transition count 1876
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 731 transition count 1876
Applied a total of 18 rules in 307 ms. Remains 731 /740 variables (removed 9) and now considering 1876/1896 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 731/740 places, 1876/1896 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) 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 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 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Interrupted probabilistic random walk after 157177 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157177 steps, saw 102037 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-11 05:27:43] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
// Phase 1: matrix 1261 rows 731 cols
[2023-03-11 05:27:43] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-11 05:27:44] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 05:27:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:27:44] [INFO ] After 786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 05:27:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:27:46] [INFO ] After 1892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-11 05:27:46] [INFO ] State equation strengthened by 306 read => feed constraints.
[2023-03-11 05:27:48] [INFO ] After 1669ms SMT Verify possible using 306 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-11 05:27:49] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 1 ms to minimize.
[2023-03-11 05:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-11 05:27:50] [INFO ] After 3435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-11 05:27:51] [INFO ] After 6716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 56 ms.
Support contains 17 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1876/1876 transitions.
Applied a total of 0 rules in 124 ms. Remains 731 /731 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 731/731 places, 1876/1876 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) 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 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 :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 05:27:52] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
[2023-03-11 05:27:52] [INFO ] Invariant cache hit.
[2023-03-11 05:27:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:27:53] [INFO ] After 1686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 05:27:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:27:55] [INFO ] After 1249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 05:27:55] [INFO ] State equation strengthened by 306 read => feed constraints.
[2023-03-11 05:27:56] [INFO ] After 948ms SMT Verify possible using 306 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 05:27:56] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 1 ms to minimize.
[2023-03-11 05:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-11 05:27:57] [INFO ] After 2152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 771 ms.
[2023-03-11 05:27:58] [INFO ] After 4486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 19 ms.
Support contains 13 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1876/1876 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 727 transition count 1868
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 727 transition count 1868
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 723 transition count 1860
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 723 transition count 1860
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 719 transition count 1844
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 719 transition count 1844
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 715 transition count 1836
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 715 transition count 1836
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 711 transition count 1828
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 711 transition count 1828
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 707 transition count 1820
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 707 transition count 1820
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 703 transition count 1812
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 703 transition count 1812
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 699 transition count 1804
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 699 transition count 1804
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 695 transition count 1796
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 695 transition count 1796
Applied a total of 72 rules in 273 ms. Remains 695 /731 variables (removed 36) and now considering 1796/1876 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 695/731 places, 1796/1876 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) 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 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 05:27:58] [INFO ] Flow matrix only has 1205 transitions (discarded 591 similar events)
// Phase 1: matrix 1205 rows 695 cols
[2023-03-11 05:27:58] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 05:27:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:27:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:00] [INFO ] After 1609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:28:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:28:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:01] [INFO ] After 1013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:01] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-11 05:28:03] [INFO ] After 1134ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:03] [INFO ] Deduced a trap composed of 139 places in 169 ms of which 0 ms to minimize.
[2023-03-11 05:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-11 05:28:03] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 0 ms to minimize.
[2023-03-11 05:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-11 05:28:03] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 0 ms to minimize.
[2023-03-11 05:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-11 05:28:04] [INFO ] After 2745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-11 05:28:05] [INFO ] After 4636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 27 ms.
Support contains 12 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1796/1796 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 694 transition count 1792
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 694 transition count 1792
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 693 transition count 1790
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 693 transition count 1790
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 692 transition count 1786
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 692 transition count 1786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 691 transition count 1784
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 691 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 690 transition count 1782
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 690 transition count 1782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 689 transition count 1780
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 689 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 688 transition count 1778
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 688 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 687 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 687 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 686 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 686 transition count 1774
Applied a total of 18 rules in 262 ms. Remains 686 /695 variables (removed 9) and now considering 1774/1796 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 686/695 places, 1774/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 186378 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186378 steps, saw 120990 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-11 05:28:08] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
// Phase 1: matrix 1190 rows 686 cols
[2023-03-11 05:28:08] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 05:28:09] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:28:10] [INFO ] After 1499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:28:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:11] [INFO ] After 1005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:11] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 05:28:12] [INFO ] After 982ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:12] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-11 05:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-11 05:28:13] [INFO ] After 2176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 627 ms.
[2023-03-11 05:28:14] [INFO ] After 4051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 48 ms.
Support contains 12 out of 686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1774/1774 transitions.
Applied a total of 0 rules in 94 ms. Remains 686 /686 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 686/686 places, 1774/1774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 686/686 places, 1774/1774 transitions.
Applied a total of 0 rules in 99 ms. Remains 686 /686 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2023-03-11 05:28:14] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-11 05:28:14] [INFO ] Invariant cache hit.
[2023-03-11 05:28:15] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-11 05:28:15] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-11 05:28:15] [INFO ] Invariant cache hit.
[2023-03-11 05:28:15] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 05:28:16] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-03-11 05:28:16] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-11 05:28:16] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-11 05:28:16] [INFO ] Invariant cache hit.
[2023-03-11 05:28:17] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2762 ms. Remains : 686/686 places, 1774/1774 transitions.
Graph (trivial) has 1044 edges and 686 vertex of which 192 / 686 are part of one of the 64 SCC in 6 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 456 transitions
Reduce isomorphic transitions removed 776 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 558 transition count 986
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 546 transition count 986
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 25 place count 546 transition count 887
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 223 place count 447 transition count 887
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 286 place count 384 transition count 824
Iterating global reduction 2 with 63 rules applied. Total rules applied 349 place count 384 transition count 824
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 475 place count 384 transition count 698
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 741 place count 251 transition count 565
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 805 place count 187 transition count 437
Iterating global reduction 3 with 64 rules applied. Total rules applied 869 place count 187 transition count 437
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 871 place count 187 transition count 435
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 934 place count 124 transition count 309
Iterating global reduction 4 with 63 rules applied. Total rules applied 997 place count 124 transition count 309
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1060 place count 61 transition count 183
Iterating global reduction 4 with 63 rules applied. Total rules applied 1123 place count 61 transition count 183
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1186 place count 61 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1186 place count 61 transition count 119
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 1188 place count 60 transition count 119
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 1190 place count 59 transition count 118
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1204 place count 52 transition count 118
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 1216 place count 52 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1217 place count 52 transition count 106
Applied a total of 1217 rules in 91 ms. Remains 52 /686 variables (removed 634) and now considering 106/1774 (removed 1668) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 106 rows 52 cols
[2023-03-11 05:28:17] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 05:28:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:28:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:28:17] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 05:28:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:28:17] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:28:17] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 05:28:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:28:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-11 05:28:17] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:17] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 05:28:17] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 05:28:17] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA FunctionPointer-PT-c004-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
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' '!(G(F(p0)))'
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 725 transition count 1892
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 725 transition count 1892
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 725 transition count 1884
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 712 transition count 1854
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 712 transition count 1854
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 76 place count 700 transition count 1814
Iterating global reduction 1 with 12 rules applied. Total rules applied 88 place count 700 transition count 1814
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 102 place count 686 transition count 1762
Iterating global reduction 1 with 14 rules applied. Total rules applied 116 place count 686 transition count 1762
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 130 place count 672 transition count 1724
Iterating global reduction 1 with 14 rules applied. Total rules applied 144 place count 672 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 158 place count 658 transition count 1696
Iterating global reduction 1 with 14 rules applied. Total rules applied 172 place count 658 transition count 1696
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 186 place count 644 transition count 1668
Iterating global reduction 1 with 14 rules applied. Total rules applied 200 place count 644 transition count 1668
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 213 place count 631 transition count 1642
Iterating global reduction 1 with 13 rules applied. Total rules applied 226 place count 631 transition count 1642
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 238 place count 619 transition count 1618
Iterating global reduction 1 with 12 rules applied. Total rules applied 250 place count 619 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 255 place count 614 transition count 1608
Iterating global reduction 1 with 5 rules applied. Total rules applied 260 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 264 place count 614 transition count 1604
Applied a total of 264 rules in 685 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-11 05:28:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 05:28:18] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 05:28:19] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-11 05:28:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:19] [INFO ] Invariant cache hit.
[2023-03-11 05:28:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:20] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2023-03-11 05:28:20] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-11 05:28:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:20] [INFO ] Invariant cache hit.
[2023-03-11 05:28:21] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/740 places, 1604/1928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2962 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 515 ms.
Product exploration explored 100000 steps with 0 reset in 490 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 544956 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 544956 steps, saw 353708 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:28:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:25] [INFO ] Invariant cache hit.
[2023-03-11 05:28:25] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:25] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:28:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:28:26] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:26] [INFO ] After 204ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:26] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 05:28:26] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.4 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 422 transition count 1220
Applied a total of 385 rules in 58 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 650287 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650287 steps, saw 398741 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:28:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2023-03-11 05:28:29] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-11 05:28:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 05:28:30] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:30] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:28:30] [INFO ] After 112ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:30] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-11 05:28:30] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2023-03-11 05:28:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-11 05:28:30] [INFO ] Invariant cache hit.
[2023-03-11 05:28:31] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-11 05:28:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-11 05:28:31] [INFO ] Invariant cache hit.
[2023-03-11 05:28:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:28:32] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-11 05:28:32] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 05:28:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-11 05:28:32] [INFO ] Invariant cache hit.
[2023-03-11 05:28:32] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1527 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
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 697 place count 339 transition count 606
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 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
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 1397 place count 21 transition count 34
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 1399 place count 20 transition count 33
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 1401 place count 19 transition count 33
Applied a total of 1401 rules in 25 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2023-03-11 05:28:32] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 05:28:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 05:28:32] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 05:28:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:28:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:28:32] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:28:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 05:28:32] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:32] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:32] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 05:28:32] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL 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-11 05:28:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-11 05:28:32] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 05:28:33] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 05:28:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:33] [INFO ] Invariant cache hit.
[2023-03-11 05:28:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:34] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2023-03-11 05:28:34] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:28:34] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:34] [INFO ] Invariant cache hit.
[2023-03-11 05:28:35] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2315 ms. Remains : 614/614 places, 1604/1604 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 550772 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550772 steps, saw 357485 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:28:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:38] [INFO ] Invariant cache hit.
[2023-03-11 05:28:38] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:28:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:38] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:28:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:39] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:39] [INFO ] After 206ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:28:39] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 05:28:39] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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.
Graph (complete) has 2680 edges and 614 vertex of which 422 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 422 transition count 1220
Applied a total of 385 rules in 45 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/614 places, 1220/1604 transitions.
Finished random walk after 317 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 83 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-11 05:28:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:40] [INFO ] Invariant cache hit.
[2023-03-11 05:28:41] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-11 05:28:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:41] [INFO ] Invariant cache hit.
[2023-03-11 05:28:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:42] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-11 05:28:42] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 05:28:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:42] [INFO ] Invariant cache hit.
[2023-03-11 05:28:43] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2322 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-00 finished in 25310 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)))'
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 725 transition count 1892
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 725 transition count 1892
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 725 transition count 1884
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 712 transition count 1854
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 712 transition count 1854
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 76 place count 700 transition count 1814
Iterating global reduction 1 with 12 rules applied. Total rules applied 88 place count 700 transition count 1814
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 102 place count 686 transition count 1762
Iterating global reduction 1 with 14 rules applied. Total rules applied 116 place count 686 transition count 1762
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 130 place count 672 transition count 1724
Iterating global reduction 1 with 14 rules applied. Total rules applied 144 place count 672 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 158 place count 658 transition count 1696
Iterating global reduction 1 with 14 rules applied. Total rules applied 172 place count 658 transition count 1696
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 186 place count 644 transition count 1668
Iterating global reduction 1 with 14 rules applied. Total rules applied 200 place count 644 transition count 1668
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 213 place count 631 transition count 1642
Iterating global reduction 1 with 13 rules applied. Total rules applied 226 place count 631 transition count 1642
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 238 place count 619 transition count 1618
Iterating global reduction 1 with 12 rules applied. Total rules applied 250 place count 619 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 255 place count 614 transition count 1608
Iterating global reduction 1 with 5 rules applied. Total rules applied 260 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 264 place count 614 transition count 1604
Applied a total of 264 rules in 350 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-11 05:28:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:43] [INFO ] Invariant cache hit.
[2023-03-11 05:28:44] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-11 05:28:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:44] [INFO ] Invariant cache hit.
[2023-03-11 05:28:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 05:28:45] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
[2023-03-11 05:28:45] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:28:45] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-11 05:28:45] [INFO ] Invariant cache hit.
[2023-03-11 05:28:45] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/740 places, 1604/1928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2535 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Stack based approach found an accepted trace after 6696 steps with 0 reset with depth 6697 and stack size 6697 in 34 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-03 finished in 3031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1||G(p2)))||F(p2)||p0))))'
Support contains 4 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 727 transition count 1896
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 727 transition count 1896
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 727 transition count 1890
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 716 transition count 1864
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 716 transition count 1864
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 706 transition count 1830
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 706 transition count 1830
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 86 place count 694 transition count 1786
Iterating global reduction 1 with 12 rules applied. Total rules applied 98 place count 694 transition count 1786
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 682 transition count 1754
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 682 transition count 1754
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 134 place count 670 transition count 1730
Iterating global reduction 1 with 12 rules applied. Total rules applied 146 place count 670 transition count 1730
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 658 transition count 1706
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 658 transition count 1706
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 181 place count 647 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 192 place count 647 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 202 place count 637 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 212 place count 637 transition count 1664
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 216 place count 633 transition count 1656
Iterating global reduction 1 with 4 rules applied. Total rules applied 220 place count 633 transition count 1656
Applied a total of 220 rules in 169 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-11 05:28:46] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:28:46] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 05:28:46] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-11 05:28:46] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:28:46] [INFO ] Invariant cache hit.
[2023-03-11 05:28:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:28:48] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2023-03-11 05:28:48] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:28:48] [INFO ] Invariant cache hit.
[2023-03-11 05:28:48] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 633/740 places, 1656/1928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2451 ms. Remains : 633/740 places, 1656/1928 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s562 1)), p2:(AND (GEQ s0 1) (GEQ s549 1)), p1:(AND (GEQ s0 1) (GEQ s559 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 0 reset in 443 ms.
Product exploration explored 100000 steps with 0 reset in 437 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 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 514 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) 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 6) 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 6) 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 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 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 223624 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223624 steps, saw 145163 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:28:53] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:28:53] [INFO ] Invariant cache hit.
[2023-03-11 05:28:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:54] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:28:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:28:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:28:55] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:28:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:28:57] [INFO ] After 1258ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:28:57] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-11 05:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-11 05:28:58] [INFO ] After 2514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1026 ms.
[2023-03-11 05:28:59] [INFO ] After 5062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 148 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) 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 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 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 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 229388 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229388 steps, saw 148902 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:29:02] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-11 05:29:02] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 05:29:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 05:29:03] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 05:29:04] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:06] [INFO ] After 1112ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:06] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2023-03-11 05:29:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-11 05:29:07] [INFO ] After 2354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 689 ms.
[2023-03-11 05:29:07] [INFO ] After 4540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 74 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 73 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-11 05:29:08] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:08] [INFO ] Invariant cache hit.
[2023-03-11 05:29:08] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-11 05:29:08] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:08] [INFO ] Invariant cache hit.
[2023-03-11 05:29:08] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:09] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
[2023-03-11 05:29:09] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:29:09] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:09] [INFO ] Invariant cache hit.
[2023-03-11 05:29:10] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2307 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 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 419 transitions
Reduce isomorphic transitions removed 739 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 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
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 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
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 1137 place count 32 transition count 56
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 1139 place count 31 transition count 55
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 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 45 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2023-03-11 05:29:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:29:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:29:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:29:10] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:29:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:29:10] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:29:10] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:10] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 05:29:10] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 12 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-11 05:29:11] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:29:11] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 05:29:11] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-11 05:29:11] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:29:11] [INFO ] Invariant cache hit.
[2023-03-11 05:29:11] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:13] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-11 05:29:13] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:29:13] [INFO ] Invariant cache hit.
[2023-03-11 05:29:13] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2328 ms. Remains : 633/633 places, 1656/1656 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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 620 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) 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 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 236226 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236226 steps, saw 153343 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:29:17] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:29:17] [INFO ] Invariant cache hit.
[2023-03-11 05:29:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:29:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:29:18] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:29:19] [INFO ] After 1365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:19] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:21] [INFO ] After 1269ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:21] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-11 05:29:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-11 05:29:22] [INFO ] After 2528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1053 ms.
[2023-03-11 05:29:23] [INFO ] After 5122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 143 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 231314 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231314 steps, saw 150154 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:29:26] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-11 05:29:26] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 05:29:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:27] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:28] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:29] [INFO ] After 1124ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-11 05:29:31] [INFO ] After 2368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 703 ms.
[2023-03-11 05:29:31] [INFO ] After 4557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 72 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 71 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-11 05:29:31] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:31] [INFO ] Invariant cache hit.
[2023-03-11 05:29:32] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-11 05:29:32] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:32] [INFO ] Invariant cache hit.
[2023-03-11 05:29:32] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:33] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-11 05:29:33] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:29:33] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:29:33] [INFO ] Invariant cache hit.
[2023-03-11 05:29:34] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2297 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 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 419 transitions
Reduce isomorphic transitions removed 739 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 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
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 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
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 1137 place count 32 transition count 56
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 1139 place count 31 transition count 55
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 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 29 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2023-03-11 05:29:34] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 05:29:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:29:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:29:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:34] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:29:34] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:34] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 05:29:34] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 661 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 393 ms.
Product exploration explored 100000 steps with 0 reset in 486 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 19 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-11 05:29:36] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:29:36] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 05:29:36] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 05:29:36] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:29:36] [INFO ] Invariant cache hit.
[2023-03-11 05:29:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:29:38] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2023-03-11 05:29:38] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:29:38] [INFO ] Invariant cache hit.
[2023-03-11 05:29:38] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2441 ms. Remains : 633/633 places, 1656/1656 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 52612 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))'
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 725 transition count 1892
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 725 transition count 1892
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 725 transition count 1884
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 711 transition count 1852
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 711 transition count 1852
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 79 place count 698 transition count 1808
Iterating global reduction 1 with 13 rules applied. Total rules applied 92 place count 698 transition count 1808
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 107 place count 683 transition count 1752
Iterating global reduction 1 with 15 rules applied. Total rules applied 122 place count 683 transition count 1752
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 137 place count 668 transition count 1712
Iterating global reduction 1 with 15 rules applied. Total rules applied 152 place count 668 transition count 1712
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 167 place count 653 transition count 1682
Iterating global reduction 1 with 15 rules applied. Total rules applied 182 place count 653 transition count 1682
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 197 place count 638 transition count 1652
Iterating global reduction 1 with 15 rules applied. Total rules applied 212 place count 638 transition count 1652
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 226 place count 624 transition count 1624
Iterating global reduction 1 with 14 rules applied. Total rules applied 240 place count 624 transition count 1624
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 253 place count 611 transition count 1598
Iterating global reduction 1 with 13 rules applied. Total rules applied 266 place count 611 transition count 1598
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 271 place count 606 transition count 1588
Iterating global reduction 1 with 5 rules applied. Total rules applied 276 place count 606 transition count 1588
Applied a total of 276 rules in 159 ms. Remains 606 /740 variables (removed 134) and now considering 1588/1928 (removed 340) transitions.
[2023-03-11 05:29:39] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2023-03-11 05:29:39] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 05:29:39] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-11 05:29:39] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-11 05:29:39] [INFO ] Invariant cache hit.
[2023-03-11 05:29:39] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 05:29:40] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2023-03-11 05:29:40] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-11 05:29:40] [INFO ] Invariant cache hit.
[2023-03-11 05:29:41] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 606/740 places, 1588/1928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2315 ms. Remains : 606/740 places, 1588/1928 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s519 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-05 finished in 2408 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) U (G(!p1) U p2)))'
Support contains 5 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 727 transition count 1898
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 727 transition count 1898
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 727 transition count 1894
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 716 transition count 1868
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 716 transition count 1868
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 706 transition count 1832
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 706 transition count 1832
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 83 place count 695 transition count 1792
Iterating global reduction 1 with 11 rules applied. Total rules applied 94 place count 695 transition count 1792
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 105 place count 684 transition count 1766
Iterating global reduction 1 with 11 rules applied. Total rules applied 116 place count 684 transition count 1766
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 127 place count 673 transition count 1744
Iterating global reduction 1 with 11 rules applied. Total rules applied 138 place count 673 transition count 1744
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 662 transition count 1722
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 662 transition count 1722
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 170 place count 652 transition count 1702
Iterating global reduction 1 with 10 rules applied. Total rules applied 180 place count 652 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 189 place count 643 transition count 1684
Iterating global reduction 1 with 9 rules applied. Total rules applied 198 place count 643 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 200 place count 641 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 202 place count 641 transition count 1680
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 212 place count 641 transition count 1670
Applied a total of 212 rules in 333 ms. Remains 641 /740 variables (removed 99) and now considering 1670/1928 (removed 258) transitions.
[2023-03-11 05:29:41] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-11 05:29:41] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 05:29:42] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-11 05:29:42] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:29:42] [INFO ] Invariant cache hit.
[2023-03-11 05:29:42] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:29:43] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-11 05:29:43] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:29:43] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:29:43] [INFO ] Invariant cache hit.
[2023-03-11 05:29:44] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 641/740 places, 1670/1928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2747 ms. Remains : 641/740 places, 1670/1928 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s558 1)), p1:(AND (GEQ s0 1) (GEQ s570 1)), p0:(AND (GEQ s0 1) (GEQ s560 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 510 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 p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) 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 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 242126 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242126 steps, saw 157172 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:29:49] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:29:49] [INFO ] Invariant cache hit.
[2023-03-11 05:29:49] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:29:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:49] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:29:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:50] [INFO ] After 1149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:50] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:29:51] [INFO ] After 948ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:29:51] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-11 05:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-11 05:29:52] [INFO ] After 1884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-11 05:29:53] [INFO ] After 3857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 77 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) 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 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 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) 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 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 05:29:53] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:29:53] [INFO ] Invariant cache hit.
[2023-03-11 05:29:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:29:53] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:29:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:29:54] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:29:54] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:29:55] [INFO ] After 726ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:29:55] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 1 ms to minimize.
[2023-03-11 05:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-11 05:29:56] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-11 05:29:56] [INFO ] After 2983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 72 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 251201 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251201 steps, saw 163061 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 05:30:00] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:00] [INFO ] Invariant cache hit.
[2023-03-11 05:30:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:00] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:30:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:30:01] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:30:01] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:02] [INFO ] After 710ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:30:02] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 4 ms to minimize.
[2023-03-11 05:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-11 05:30:03] [INFO ] After 1616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 482 ms.
[2023-03-11 05:30:03] [INFO ] After 2992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 72 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 641/641 places, 1670/1670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 72 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-11 05:30:03] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:03] [INFO ] Invariant cache hit.
[2023-03-11 05:30:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-11 05:30:04] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:04] [INFO ] Invariant cache hit.
[2023-03-11 05:30:04] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:05] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-11 05:30:05] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 05:30:05] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:05] [INFO ] Invariant cache hit.
[2023-03-11 05:30:06] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2351 ms. Remains : 641/641 places, 1670/1670 transitions.
Graph (trivial) has 988 edges and 641 vertex of which 192 / 641 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 746 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 513 transition count 915
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 504 transition count 915
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 19 place count 504 transition count 831
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 187 place count 420 transition count 831
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 250 place count 357 transition count 768
Iterating global reduction 2 with 63 rules applied. Total rules applied 313 place count 357 transition count 768
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 439 place count 357 transition count 642
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 701 place count 226 transition count 511
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 765 place count 162 transition count 383
Iterating global reduction 3 with 64 rules applied. Total rules applied 829 place count 162 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 162 transition count 382
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 893 place count 99 transition count 256
Iterating global reduction 4 with 63 rules applied. Total rules applied 956 place count 99 transition count 256
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1019 place count 36 transition count 130
Iterating global reduction 4 with 63 rules applied. Total rules applied 1082 place count 36 transition count 130
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1145 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1145 place count 36 transition count 66
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 1147 place count 35 transition count 66
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 1149 place count 34 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1157 place count 30 transition count 65
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 30 transition count 58
Applied a total of 1164 rules in 29 ms. Remains 30 /641 variables (removed 611) and now considering 58/1670 (removed 1612) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 58 rows 30 cols
[2023-03-11 05:30:06] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:30:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:06] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:30:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:06] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:30:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:30:06] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:30:06] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 05:30:06] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 527 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-11 05:30:06] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-11 05:30:07] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 05:30:07] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:30:08] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2023-03-11 05:30:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:30:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-11 05:30:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:30:10] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-11 05:30:10] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:10] [INFO ] [Nat]Added 274 Read/Feed constraints in 92 ms returned sat
[2023-03-11 05:30:10] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 179 ms.
[2023-03-11 05:30:10] [INFO ] Added : 10 causal constraints over 2 iterations in 395 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 82 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-11 05:30:10] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:10] [INFO ] Invariant cache hit.
[2023-03-11 05:30:10] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-11 05:30:10] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:10] [INFO ] Invariant cache hit.
[2023-03-11 05:30:11] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:12] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2023-03-11 05:30:12] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 05:30:12] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:12] [INFO ] Invariant cache hit.
[2023-03-11 05:30:13] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2451 ms. Remains : 641/641 places, 1670/1670 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 566 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 238586 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238586 steps, saw 154873 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:30:17] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:17] [INFO ] Invariant cache hit.
[2023-03-11 05:30:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:17] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:30:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:30:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:30:18] [INFO ] After 1162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:18] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:19] [INFO ] After 964ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:19] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2023-03-11 05:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-11 05:30:20] [INFO ] After 1916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 658 ms.
[2023-03-11 05:30:21] [INFO ] After 3915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 76 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 228212 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228212 steps, saw 148142 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:30:24] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:24] [INFO ] Invariant cache hit.
[2023-03-11 05:30:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:30:24] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:30:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:25] [INFO ] After 1151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:25] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:26] [INFO ] After 955ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:27] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-11 05:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-11 05:30:27] [INFO ] After 1884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 655 ms.
[2023-03-11 05:30:28] [INFO ] After 3870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 73 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 641/641 places, 1670/1670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 78 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-11 05:30:28] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:28] [INFO ] Invariant cache hit.
[2023-03-11 05:30:28] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-11 05:30:28] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:28] [INFO ] Invariant cache hit.
[2023-03-11 05:30:29] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:30] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2023-03-11 05:30:30] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 05:30:30] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:30] [INFO ] Invariant cache hit.
[2023-03-11 05:30:30] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2430 ms. Remains : 641/641 places, 1670/1670 transitions.
Graph (trivial) has 988 edges and 641 vertex of which 192 / 641 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 426 transitions
Reduce isomorphic transitions removed 746 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 513 transition count 915
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 504 transition count 915
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 19 place count 504 transition count 831
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 187 place count 420 transition count 831
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 250 place count 357 transition count 768
Iterating global reduction 2 with 63 rules applied. Total rules applied 313 place count 357 transition count 768
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 439 place count 357 transition count 642
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 701 place count 226 transition count 511
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 765 place count 162 transition count 383
Iterating global reduction 3 with 64 rules applied. Total rules applied 829 place count 162 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 162 transition count 382
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 893 place count 99 transition count 256
Iterating global reduction 4 with 63 rules applied. Total rules applied 956 place count 99 transition count 256
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1019 place count 36 transition count 130
Iterating global reduction 4 with 63 rules applied. Total rules applied 1082 place count 36 transition count 130
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1145 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1145 place count 36 transition count 66
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 1147 place count 35 transition count 66
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 1149 place count 34 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1157 place count 30 transition count 65
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 30 transition count 58
Applied a total of 1164 rules in 34 ms. Remains 30 /641 variables (removed 611) and now considering 58/1670 (removed 1612) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 58 rows 30 cols
[2023-03-11 05:30:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:30:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:30:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:30:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:30:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:31] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:30:31] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:30:31] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 05:30:31] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 536 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-11 05:30:32] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-11 05:30:32] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 05:30:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 05:30:33] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2023-03-11 05:30:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 05:30:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 24 ms returned sat
[2023-03-11 05:30:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 05:30:35] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-11 05:30:35] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:35] [INFO ] [Nat]Added 274 Read/Feed constraints in 93 ms returned sat
[2023-03-11 05:30:35] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 98 ms.
[2023-03-11 05:30:35] [INFO ] Added : 10 causal constraints over 2 iterations in 274 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 468 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 80 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-11 05:30:36] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:36] [INFO ] Invariant cache hit.
[2023-03-11 05:30:37] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-11 05:30:37] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:37] [INFO ] Invariant cache hit.
[2023-03-11 05:30:37] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-11 05:30:38] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2023-03-11 05:30:38] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 05:30:38] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-11 05:30:38] [INFO ] Invariant cache hit.
[2023-03-11 05:30:38] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2222 ms. Remains : 641/641 places, 1670/1670 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-07 finished in 57554 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)||(!p1 U p2)))'
Support contains 5 out of 740 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 727 transition count 1898
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 727 transition count 1898
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 34 place count 727 transition count 1890
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 716 transition count 1864
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 716 transition count 1864
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 705 transition count 1826
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 705 transition count 1826
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 693 transition count 1782
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 693 transition count 1782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 114 place count 681 transition count 1752
Iterating global reduction 1 with 12 rules applied. Total rules applied 126 place count 681 transition count 1752
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 138 place count 669 transition count 1728
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 669 transition count 1728
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 162 place count 657 transition count 1704
Iterating global reduction 1 with 12 rules applied. Total rules applied 174 place count 657 transition count 1704
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 185 place count 646 transition count 1682
Iterating global reduction 1 with 11 rules applied. Total rules applied 196 place count 646 transition count 1682
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 206 place count 636 transition count 1662
Iterating global reduction 1 with 10 rules applied. Total rules applied 216 place count 636 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 219 place count 633 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 633 transition count 1656
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 230 place count 633 transition count 1648
Applied a total of 230 rules in 324 ms. Remains 633 /740 variables (removed 107) and now considering 1648/1928 (removed 280) transitions.
[2023-03-11 05:30:39] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-11 05:30:39] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 05:30:39] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-11 05:30:39] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:30:39] [INFO ] Invariant cache hit.
[2023-03-11 05:30:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:30:40] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
[2023-03-11 05:30:40] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 05:30:40] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:30:40] [INFO ] Invariant cache hit.
[2023-03-11 05:30:41] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 633/740 places, 1648/1928 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2499 ms. Remains : 633/740 places, 1648/1928 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s562 1)), p2:(AND (GEQ s0 1) (GEQ s551 1)), p1:(AND (GEQ s1 1) (GEQ s550 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, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 3014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 724 transition count 1890
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 724 transition count 1890
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 724 transition count 1882
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 710 transition count 1850
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 710 transition count 1850
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 81 place count 697 transition count 1806
Iterating global reduction 1 with 13 rules applied. Total rules applied 94 place count 697 transition count 1806
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 109 place count 682 transition count 1750
Iterating global reduction 1 with 15 rules applied. Total rules applied 124 place count 682 transition count 1750
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 139 place count 667 transition count 1710
Iterating global reduction 1 with 15 rules applied. Total rules applied 154 place count 667 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 169 place count 652 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 184 place count 652 transition count 1680
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 199 place count 637 transition count 1650
Iterating global reduction 1 with 15 rules applied. Total rules applied 214 place count 637 transition count 1650
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 228 place count 623 transition count 1622
Iterating global reduction 1 with 14 rules applied. Total rules applied 242 place count 623 transition count 1622
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 255 place count 610 transition count 1596
Iterating global reduction 1 with 13 rules applied. Total rules applied 268 place count 610 transition count 1596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 273 place count 605 transition count 1586
Iterating global reduction 1 with 5 rules applied. Total rules applied 278 place count 605 transition count 1586
Applied a total of 278 rules in 166 ms. Remains 605 /740 variables (removed 135) and now considering 1586/1928 (removed 342) transitions.
[2023-03-11 05:30:42] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-11 05:30:42] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 05:30:42] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 05:30:42] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:42] [INFO ] Invariant cache hit.
[2023-03-11 05:30:42] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:30:43] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2023-03-11 05:30:43] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:43] [INFO ] Invariant cache hit.
[2023-03-11 05:30:44] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/740 places, 1586/1928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2377 ms. Remains : 605/740 places, 1586/1928 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 406 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 3543 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1771 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 16 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-11 05:30:45] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:45] [INFO ] Invariant cache hit.
[2023-03-11 05:30:46] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 05:30:46] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:46] [INFO ] Invariant cache hit.
[2023-03-11 05:30:46] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:30:47] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-11 05:30:47] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:47] [INFO ] Invariant cache hit.
[2023-03-11 05:30:47] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2113 ms. Remains : 605/605 places, 1586/1586 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568124 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568124 steps, saw 368747 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:30:51] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:30:51] [INFO ] Invariant cache hit.
[2023-03-11 05:30:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:30:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:30:51] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:30:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:30:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:30:51] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:51] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:30:52] [INFO ] After 275ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:52] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-11 05:30:52] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 416 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 416 transition count 1207
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 416 transition count 1205
Applied a total of 382 rules in 88 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 670432 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 670432 steps, saw 411094 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:30:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2023-03-11 05:30:55] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-11 05:30:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 05:30:55] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:30:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 05:30:56] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:30:56] [INFO ] After 102ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:56] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-11 05:30:56] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-11 05:30:56] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:30:56] [INFO ] Invariant cache hit.
[2023-03-11 05:30:56] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-11 05:30:56] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:30:56] [INFO ] Invariant cache hit.
[2023-03-11 05:30:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:30:57] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-11 05:30:57] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 05:30:57] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:30:57] [INFO ] Invariant cache hit.
[2023-03-11 05:30:58] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1395 ms. Remains : 416/416 places, 1205/1205 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 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 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 600
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 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
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 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
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 1387 place count 17 transition count 27
Applied a total of 1387 rules in 46 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2023-03-11 05:30:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 05:30:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 05:30:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:30:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 05:30:58] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:30:58] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:30:58] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 05:30:58] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 449 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1584
Applied a total of 2 rules in 188 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2023-03-11 05:30:59] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:30:59] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-11 05:30:59] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 05:31:00] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/605 places, 1584/1586 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 605/605 places, 1584/1586 transitions.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 19 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-11 05:31:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-11 05:31:00] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 05:31:00] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-11 05:31:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:31:00] [INFO ] Invariant cache hit.
[2023-03-11 05:31:00] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:31:01] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2023-03-11 05:31:01] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:31:01] [INFO ] Invariant cache hit.
[2023-03-11 05:31:02] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2137 ms. Remains : 605/605 places, 1586/1586 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-09 finished in 20491 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((F(p1)&&X(p2)&&p0)))'
Support contains 5 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 726 transition count 1896
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 726 transition count 1896
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 726 transition count 1888
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 714 transition count 1864
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 714 transition count 1864
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 703 transition count 1826
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 703 transition count 1826
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 95 place count 690 transition count 1774
Iterating global reduction 1 with 13 rules applied. Total rules applied 108 place count 690 transition count 1774
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 121 place count 677 transition count 1738
Iterating global reduction 1 with 13 rules applied. Total rules applied 134 place count 677 transition count 1738
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 147 place count 664 transition count 1712
Iterating global reduction 1 with 13 rules applied. Total rules applied 160 place count 664 transition count 1712
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 173 place count 651 transition count 1686
Iterating global reduction 1 with 13 rules applied. Total rules applied 186 place count 651 transition count 1686
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 199 place count 638 transition count 1660
Iterating global reduction 1 with 13 rules applied. Total rules applied 212 place count 638 transition count 1660
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 225 place count 625 transition count 1634
Iterating global reduction 1 with 13 rules applied. Total rules applied 238 place count 625 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 243 place count 620 transition count 1624
Iterating global reduction 1 with 5 rules applied. Total rules applied 248 place count 620 transition count 1624
Applied a total of 248 rules in 144 ms. Remains 620 /740 variables (removed 120) and now considering 1624/1928 (removed 304) transitions.
[2023-03-11 05:31:02] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2023-03-11 05:31:02] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 05:31:02] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-11 05:31:02] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:02] [INFO ] Invariant cache hit.
[2023-03-11 05:31:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:04] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-11 05:31:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:04] [INFO ] Invariant cache hit.
[2023-03-11 05:31:04] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 620/740 places, 1624/1928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2382 ms. Remains : 620/740 places, 1624/1928 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s538 1) (GEQ s540 1)), p1:(AND (GEQ s1 1) (GEQ s538 1)), p2:(AND (GEQ s3 1) (GEQ s499 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-10 finished in 2917 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||G(!p0))))))))'
Support contains 4 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 726 transition count 1894
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 726 transition count 1894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 726 transition count 1886
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 714 transition count 1858
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 714 transition count 1858
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 703 transition count 1822
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 703 transition count 1822
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 95 place count 690 transition count 1774
Iterating global reduction 1 with 13 rules applied. Total rules applied 108 place count 690 transition count 1774
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 121 place count 677 transition count 1738
Iterating global reduction 1 with 13 rules applied. Total rules applied 134 place count 677 transition count 1738
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 147 place count 664 transition count 1712
Iterating global reduction 1 with 13 rules applied. Total rules applied 160 place count 664 transition count 1712
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 173 place count 651 transition count 1686
Iterating global reduction 1 with 13 rules applied. Total rules applied 186 place count 651 transition count 1686
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 198 place count 639 transition count 1662
Iterating global reduction 1 with 12 rules applied. Total rules applied 210 place count 639 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 221 place count 628 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 232 place count 628 transition count 1640
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 237 place count 623 transition count 1630
Iterating global reduction 1 with 5 rules applied. Total rules applied 242 place count 623 transition count 1630
Applied a total of 242 rules in 166 ms. Remains 623 /740 variables (removed 117) and now considering 1630/1928 (removed 298) transitions.
[2023-03-11 05:31:05] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:31:05] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 05:31:05] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-11 05:31:05] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:05] [INFO ] Invariant cache hit.
[2023-03-11 05:31:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:07] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2023-03-11 05:31:07] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:07] [INFO ] Invariant cache hit.
[2023-03-11 05:31:07] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/740 places, 1630/1928 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2281 ms. Remains : 623/740 places, 1630/1928 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s550 1))) (NOT (AND (GEQ s1 1) (GEQ s551 1)))), p0:(AND (GEQ s1 1) (GEQ s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 621 ms.
Product exploration explored 100000 steps with 25000 reset in 572 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 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) 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
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 341462 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341462 steps, saw 221642 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:31:12] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:12] [INFO ] Invariant cache hit.
[2023-03-11 05:31:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:12] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:31:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:31:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:31:13] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:13] [INFO ] After 358ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:13] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 0 ms to minimize.
[2023-03-11 05:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-11 05:31:14] [INFO ] After 876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-11 05:31:14] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 146 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 360152 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 360152 steps, saw 233770 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:31:17] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:31:17] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 05:31:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:18] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:31:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:31:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:18] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:19] [INFO ] After 360ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:19] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-11 05:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-11 05:31:19] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-11 05:31:19] [INFO ] After 1757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 71 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-11 05:31:20] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:20] [INFO ] Invariant cache hit.
[2023-03-11 05:31:20] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-11 05:31:20] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:20] [INFO ] Invariant cache hit.
[2023-03-11 05:31:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:21] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2023-03-11 05:31:21] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:31:21] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:21] [INFO ] Invariant cache hit.
[2023-03-11 05:31:22] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2260 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 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 411 transitions
Reduce isomorphic transitions removed 731 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 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
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 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
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 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
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 1127 place count 27 transition count 45
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 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 33 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 05:31:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:31:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:31:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:22] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:31:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:31:22] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:31:22] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 05:31:22] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:31:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:31:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:22] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:22] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:22] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 05:31:22] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 16 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-11 05:31:22] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:31:22] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 05:31:23] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-11 05:31:23] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:23] [INFO ] Invariant cache hit.
[2023-03-11 05:31:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:24] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-11 05:31:24] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:24] [INFO ] Invariant cache hit.
[2023-03-11 05:31:24] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2196 ms. Remains : 623/623 places, 1630/1630 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 327554 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327554 steps, saw 212613 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:31:28] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:28] [INFO ] Invariant cache hit.
[2023-03-11 05:31:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:28] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:31:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:31:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:29] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:29] [INFO ] After 364ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:31:30] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-11 05:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-11 05:31:30] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-11 05:31:30] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 139 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:31:30] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:31:30] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 05:31:30] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:31] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:31:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:31:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:31:31] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:31] [INFO ] After 191ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:32] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2023-03-11 05:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-11 05:31:32] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-11 05:31:32] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 75 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 623/623 places, 1624/1624 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 547206 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 547206 steps, saw 355170 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:31:35] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:35] [INFO ] Invariant cache hit.
[2023-03-11 05:31:35] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:31:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:35] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:31:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:31:36] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:36] [INFO ] After 189ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:36] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 4 ms to minimize.
[2023-03-11 05:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-11 05:31:36] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-11 05:31:36] [INFO ] After 1050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 78 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 68 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-11 05:31:37] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:37] [INFO ] Invariant cache hit.
[2023-03-11 05:31:37] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-11 05:31:37] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:37] [INFO ] Invariant cache hit.
[2023-03-11 05:31:37] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:38] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2023-03-11 05:31:38] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 05:31:38] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:31:38] [INFO ] Invariant cache hit.
[2023-03-11 05:31:39] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2192 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 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 411 transitions
Reduce isomorphic transitions removed 731 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 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
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 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
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 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
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 1127 place count 27 transition count 45
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 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 28 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 05:31:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:31:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:31:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:31:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:31:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:31:39] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:31:39] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:31:39] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 05:31:39] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 581 ms.
Product exploration explored 100000 steps with 25000 reset in 571 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 164 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
[2023-03-11 05:31:41] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:31:41] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:31:41] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-11 05:31:41] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/623 places, 1624/1630 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 623/623 places, 1624/1630 transitions.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 12 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-11 05:31:41] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:31:41] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 05:31:42] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-11 05:31:42] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:42] [INFO ] Invariant cache hit.
[2023-03-11 05:31:42] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:31:43] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
[2023-03-11 05:31:43] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:31:43] [INFO ] Invariant cache hit.
[2023-03-11 05:31:44] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2203 ms. Remains : 623/623 places, 1630/1630 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 38796 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1||G(p2)))||F(p2)||p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLFireability-04
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 740 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 727 transition count 1896
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 727 transition count 1896
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 727 transition count 1890
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 43 place count 716 transition count 1864
Iterating global reduction 1 with 11 rules applied. Total rules applied 54 place count 716 transition count 1864
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 706 transition count 1830
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 706 transition count 1830
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 86 place count 694 transition count 1786
Iterating global reduction 1 with 12 rules applied. Total rules applied 98 place count 694 transition count 1786
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 682 transition count 1754
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 682 transition count 1754
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 134 place count 670 transition count 1730
Iterating global reduction 1 with 12 rules applied. Total rules applied 146 place count 670 transition count 1730
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 658 transition count 1706
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 658 transition count 1706
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 181 place count 647 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 192 place count 647 transition count 1684
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 202 place count 637 transition count 1664
Iterating global reduction 1 with 10 rules applied. Total rules applied 212 place count 637 transition count 1664
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 216 place count 633 transition count 1656
Iterating global reduction 1 with 4 rules applied. Total rules applied 220 place count 633 transition count 1656
Applied a total of 220 rules in 192 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-11 05:31:44] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:31:44] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 05:31:45] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-11 05:31:45] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:31:45] [INFO ] Invariant cache hit.
[2023-03-11 05:31:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:31:46] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2023-03-11 05:31:46] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:31:46] [INFO ] Invariant cache hit.
[2023-03-11 05:31:46] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 633/740 places, 1656/1928 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2472 ms. Remains : 633/740 places, 1656/1928 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s562 1)), p2:(AND (GEQ s0 1) (GEQ s549 1)), p1:(AND (GEQ s0 1) (GEQ s559 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 426 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 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 509 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 230451 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230451 steps, saw 149593 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:31:51] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:31:51] [INFO ] Invariant cache hit.
[2023-03-11 05:31:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:31:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:31:52] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:31:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-11 05:31:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:31:53] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:31:53] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:31:55] [INFO ] After 1271ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:31:55] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-11 05:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-11 05:31:56] [INFO ] After 2498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1041 ms.
[2023-03-11 05:31:57] [INFO ] After 5058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 141 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 229280 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229280 steps, saw 148835 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:32:00] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-11 05:32:00] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 05:32:00] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:01] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:32:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:32:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:02] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:02] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:03] [INFO ] After 1101ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:04] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2023-03-11 05:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-11 05:32:05] [INFO ] After 2348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 719 ms.
[2023-03-11 05:32:05] [INFO ] After 4553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 71 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 70 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-11 05:32:05] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:05] [INFO ] Invariant cache hit.
[2023-03-11 05:32:06] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-11 05:32:06] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:06] [INFO ] Invariant cache hit.
[2023-03-11 05:32:06] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:07] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2023-03-11 05:32:07] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 05:32:07] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:07] [INFO ] Invariant cache hit.
[2023-03-11 05:32:08] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2304 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 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 419 transitions
Reduce isomorphic transitions removed 739 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 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
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 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
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 1137 place count 32 transition count 56
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 1139 place count 31 transition count 55
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 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 30 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2023-03-11 05:32:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:32:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:32:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:08] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:32:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:32:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:08] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:32:08] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:08] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 05:32:08] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) (NOT p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 20 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-11 05:32:09] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:32:09] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 05:32:09] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 05:32:09] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:32:09] [INFO ] Invariant cache hit.
[2023-03-11 05:32:09] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:11] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2023-03-11 05:32:11] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:32:11] [INFO ] Invariant cache hit.
[2023-03-11 05:32:11] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2381 ms. Remains : 633/633 places, 1656/1656 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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 475 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 233217 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233217 steps, saw 151390 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:32:15] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:32:15] [INFO ] Invariant cache hit.
[2023-03-11 05:32:15] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:32:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:15] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:32:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:32:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:17] [INFO ] After 1328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:17] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:18] [INFO ] After 1244ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:19] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2023-03-11 05:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-11 05:32:19] [INFO ] After 2473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1025 ms.
[2023-03-11 05:32:20] [INFO ] After 4992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 144 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 233374 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233374 steps, saw 151490 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 05:32:24] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-11 05:32:24] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 05:32:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:24] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:32:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 05:32:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:26] [INFO ] After 1293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:27] [INFO ] After 1104ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:27] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
[2023-03-11 05:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-11 05:32:28] [INFO ] After 2323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 683 ms.
[2023-03-11 05:32:29] [INFO ] After 4475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 74 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 70 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-11 05:32:29] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:29] [INFO ] Invariant cache hit.
[2023-03-11 05:32:29] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-11 05:32:29] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:29] [INFO ] Invariant cache hit.
[2023-03-11 05:32:30] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:31] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2023-03-11 05:32:31] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:32:31] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-11 05:32:31] [INFO ] Invariant cache hit.
[2023-03-11 05:32:31] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2398 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 3 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 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 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
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 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
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 1137 place count 32 transition count 56
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 1139 place count 31 transition count 55
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 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 35 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2023-03-11 05:32:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:32:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:32:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 05:32:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:32:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:32] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:32:32] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 05:32:32] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 05:32:32] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 428 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 448 ms.
Product exploration explored 100000 steps with 0 reset in 426 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 19 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-11 05:32:33] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-11 05:32:33] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-11 05:32:34] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-11 05:32:34] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:32:34] [INFO ] Invariant cache hit.
[2023-03-11 05:32:34] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-11 05:32:35] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2023-03-11 05:32:35] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-11 05:32:35] [INFO ] Invariant cache hit.
[2023-03-11 05:32:35] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2245 ms. Remains : 633/633 places, 1656/1656 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 51770 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) U (G(!p1) U p2)))'
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)))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLFireability-09
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 740 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 724 transition count 1890
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 724 transition count 1890
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 724 transition count 1882
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 710 transition count 1850
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 710 transition count 1850
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 81 place count 697 transition count 1806
Iterating global reduction 1 with 13 rules applied. Total rules applied 94 place count 697 transition count 1806
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 109 place count 682 transition count 1750
Iterating global reduction 1 with 15 rules applied. Total rules applied 124 place count 682 transition count 1750
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 139 place count 667 transition count 1710
Iterating global reduction 1 with 15 rules applied. Total rules applied 154 place count 667 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 169 place count 652 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 184 place count 652 transition count 1680
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 199 place count 637 transition count 1650
Iterating global reduction 1 with 15 rules applied. Total rules applied 214 place count 637 transition count 1650
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 228 place count 623 transition count 1622
Iterating global reduction 1 with 14 rules applied. Total rules applied 242 place count 623 transition count 1622
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 255 place count 610 transition count 1596
Iterating global reduction 1 with 13 rules applied. Total rules applied 268 place count 610 transition count 1596
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 273 place count 605 transition count 1586
Iterating global reduction 1 with 5 rules applied. Total rules applied 278 place count 605 transition count 1586
Applied a total of 278 rules in 175 ms. Remains 605 /740 variables (removed 135) and now considering 1586/1928 (removed 342) transitions.
[2023-03-11 05:32:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-11 05:32:36] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 05:32:36] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-11 05:32:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:36] [INFO ] Invariant cache hit.
[2023-03-11 05:32:36] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:32:38] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2023-03-11 05:32:38] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:38] [INFO ] Invariant cache hit.
[2023-03-11 05:32:38] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 605/740 places, 1586/1928 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2284 ms. Remains : 605/740 places, 1586/1928 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 421 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished Best-First random walk after 228 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=228 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 11 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-11 05:32:39] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:39] [INFO ] Invariant cache hit.
[2023-03-11 05:32:40] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-11 05:32:40] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:40] [INFO ] Invariant cache hit.
[2023-03-11 05:32:40] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:32:41] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2023-03-11 05:32:41] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:41] [INFO ] Invariant cache hit.
[2023-03-11 05:32:41] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2050 ms. Remains : 605/605 places, 1586/1586 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 569351 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569351 steps, saw 369541 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:32:45] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-11 05:32:45] [INFO ] Invariant cache hit.
[2023-03-11 05:32:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-11 05:32:45] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:32:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:32:45] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:45] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-11 05:32:46] [INFO ] After 281ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:46] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-11 05:32:46] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 416 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 416 transition count 1207
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 416 transition count 1205
Applied a total of 382 rules in 84 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 668028 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668028 steps, saw 409621 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:32:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2023-03-11 05:32:49] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-11 05:32:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:49] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:32:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:50] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:32:50] [INFO ] After 97ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:50] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-11 05:32:50] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 49 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-11 05:32:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:32:50] [INFO ] Invariant cache hit.
[2023-03-11 05:32:50] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-11 05:32:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:32:50] [INFO ] Invariant cache hit.
[2023-03-11 05:32:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 05:32:51] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-11 05:32:51] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 05:32:51] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-11 05:32:51] [INFO ] Invariant cache hit.
[2023-03-11 05:32:52] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 ms. Remains : 416/416 places, 1205/1205 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 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 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
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 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
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 1387 place count 17 transition count 27
Applied a total of 1387 rules in 24 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2023-03-11 05:32:52] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 05:32:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 05:32:52] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:32:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 05:32:52] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:32:52] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:52] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 05:32:52] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 1 ms.
Treatment of property FunctionPointer-PT-c004-LTLFireability-09 finished in 16361 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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||G(!p0))))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c004-LTLFireability-13
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4 out of 740 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 726 transition count 1894
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 726 transition count 1894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 726 transition count 1886
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 714 transition count 1858
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 714 transition count 1858
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 703 transition count 1822
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 703 transition count 1822
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 95 place count 690 transition count 1774
Iterating global reduction 1 with 13 rules applied. Total rules applied 108 place count 690 transition count 1774
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 121 place count 677 transition count 1738
Iterating global reduction 1 with 13 rules applied. Total rules applied 134 place count 677 transition count 1738
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 147 place count 664 transition count 1712
Iterating global reduction 1 with 13 rules applied. Total rules applied 160 place count 664 transition count 1712
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 173 place count 651 transition count 1686
Iterating global reduction 1 with 13 rules applied. Total rules applied 186 place count 651 transition count 1686
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 198 place count 639 transition count 1662
Iterating global reduction 1 with 12 rules applied. Total rules applied 210 place count 639 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 221 place count 628 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 232 place count 628 transition count 1640
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 237 place count 623 transition count 1630
Iterating global reduction 1 with 5 rules applied. Total rules applied 242 place count 623 transition count 1630
Applied a total of 242 rules in 195 ms. Remains 623 /740 variables (removed 117) and now considering 1630/1928 (removed 298) transitions.
[2023-03-11 05:32:52] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:32:52] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-11 05:32:53] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-11 05:32:53] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:32:53] [INFO ] Invariant cache hit.
[2023-03-11 05:32:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:32:54] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-11 05:32:54] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:32:54] [INFO ] Invariant cache hit.
[2023-03-11 05:32:55] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 623/740 places, 1630/1928 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2694 ms. Remains : 623/740 places, 1630/1928 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s550 1))) (NOT (AND (GEQ s1 1) (GEQ s551 1)))), p0:(AND (GEQ s1 1) (GEQ s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 564 ms.
Product exploration explored 100000 steps with 25000 reset in 575 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 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:32:56] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:32:56] [INFO ] Invariant cache hit.
[2023-03-11 05:32:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:57] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:32:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:32:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:32:57] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:57] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:32:57] [INFO ] After 155ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:32:58] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 1 ms to minimize.
[2023-03-11 05:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-11 05:32:58] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-11 05:32:58] [INFO ] After 1159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 138 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 550734 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550734 steps, saw 357458 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:33:01] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:33:01] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 05:33:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:33:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:33:02] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:33:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:33:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:33:02] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:33:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:02] [INFO ] After 188ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:33:02] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-11 05:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-11 05:33:03] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-11 05:33:03] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-11 05:33:03] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:03] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-11 05:33:03] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:03] [INFO ] Invariant cache hit.
[2023-03-11 05:33:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:04] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2023-03-11 05:33:04] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 05:33:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:04] [INFO ] Invariant cache hit.
[2023-03-11 05:33:05] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2145 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 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 411 transitions
Reduce isomorphic transitions removed 731 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 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
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 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
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 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
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 1127 place count 27 transition count 45
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 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 27 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 05:33:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 05:33:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:33:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:33:05] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:33:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:33:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:33:05] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:33:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:33:05] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:33:05] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 05:33:05] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 16 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-11 05:33:05] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:33:05] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 05:33:06] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-11 05:33:06] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:33:06] [INFO ] Invariant cache hit.
[2023-03-11 05:33:06] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:07] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-11 05:33:07] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:33:07] [INFO ] Invariant cache hit.
[2023-03-11 05:33:08] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2519 ms. Remains : 623/623 places, 1630/1630 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 274953 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274953 steps, saw 178476 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:33:11] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:33:11] [INFO ] Invariant cache hit.
[2023-03-11 05:33:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:33:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:33:12] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:33:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-11 05:33:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 05:33:12] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:13] [INFO ] After 356ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:13] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 0 ms to minimize.
[2023-03-11 05:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-11 05:33:13] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-11 05:33:13] [INFO ] After 1773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 141 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 277651 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277651 steps, saw 180227 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:33:17] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:33:17] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 05:33:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 05:33:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 05:33:17] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:33:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 05:33:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:33:18] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:18] [INFO ] After 365ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:18] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-11 05:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-11 05:33:19] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-11 05:33:19] [INFO ] After 1770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 69 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 68 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-11 05:33:19] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:19] [INFO ] Invariant cache hit.
[2023-03-11 05:33:19] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-11 05:33:19] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:19] [INFO ] Invariant cache hit.
[2023-03-11 05:33:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:21] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2023-03-11 05:33:21] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 05:33:21] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-11 05:33:21] [INFO ] Invariant cache hit.
[2023-03-11 05:33:21] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2125 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 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 411 transitions
Reduce isomorphic transitions removed 731 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 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
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 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
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 1127 place count 27 transition count 45
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 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 27 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-11 05:33:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 05:33:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:33:21] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:33:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 05:33:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:33:21] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 05:33:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 05:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 05:33:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 05:33:21] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:21] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:33:21] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 05:33:21] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 567 ms.
Product exploration explored 100000 steps with 25000 reset in 578 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 1630/1630 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 623 transition count 1624
Applied a total of 6 rules in 160 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
[2023-03-11 05:33:23] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 05:33:23] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-11 05:33:23] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-11 05:33:24] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/623 places, 1624/1630 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 675 ms. Remains : 623/623 places, 1624/1630 transitions.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 12 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-11 05:33:24] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-11 05:33:24] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 05:33:24] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-11 05:33:24] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:33:24] [INFO ] Invariant cache hit.
[2023-03-11 05:33:24] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-11 05:33:26] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-11 05:33:26] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-11 05:33:26] [INFO ] Invariant cache hit.
[2023-03-11 05:33:26] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 623/623 places, 1630/1630 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 34153 ms.
[2023-03-11 05:33:26] [INFO ] Flatten gal took : 65 ms
[2023-03-11 05:33:26] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 05:33:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 740 places, 1928 transitions and 7838 arcs took 14 ms.
Total runtime 371284 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-c004
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA FunctionPointer-PT-c004-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678513543251

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-c004-LTLFireability-00
lola: time limit : 719 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/719 2/32 FunctionPointer-PT-c004-LTLFireability-00 176679 m, 35335 m/sec, 279826 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/719 4/32 FunctionPointer-PT-c004-LTLFireability-00 367346 m, 38133 m/sec, 581832 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/719 6/32 FunctionPointer-PT-c004-LTLFireability-00 557734 m, 38077 m/sec, 883397 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/719 8/32 FunctionPointer-PT-c004-LTLFireability-00 747713 m, 37995 m/sec, 1184308 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/719 10/32 FunctionPointer-PT-c004-LTLFireability-00 937841 m, 38025 m/sec, 1485464 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/719 12/32 FunctionPointer-PT-c004-LTLFireability-00 1127881 m, 38008 m/sec, 1786474 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/719 14/32 FunctionPointer-PT-c004-LTLFireability-00 1317810 m, 37985 m/sec, 2087313 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/719 15/32 FunctionPointer-PT-c004-LTLFireability-00 1507692 m, 37976 m/sec, 2388075 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/719 17/32 FunctionPointer-PT-c004-LTLFireability-00 1697504 m, 37962 m/sec, 2688725 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/719 19/32 FunctionPointer-PT-c004-LTLFireability-00 1887431 m, 37985 m/sec, 2989556 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/719 21/32 FunctionPointer-PT-c004-LTLFireability-00 2077346 m, 37983 m/sec, 3290371 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/719 23/32 FunctionPointer-PT-c004-LTLFireability-00 2267195 m, 37969 m/sec, 3591080 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/719 25/32 FunctionPointer-PT-c004-LTLFireability-00 2457044 m, 37969 m/sec, 3891790 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/719 27/32 FunctionPointer-PT-c004-LTLFireability-00 2646814 m, 37954 m/sec, 4192377 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/719 29/32 FunctionPointer-PT-c004-LTLFireability-00 2836430 m, 37923 m/sec, 4492715 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/719 31/32 FunctionPointer-PT-c004-LTLFireability-00 3026096 m, 37933 m/sec, 4793139 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/719 32/32 FunctionPointer-PT-c004-LTLFireability-00 3215793 m, 37939 m/sec, 5093605 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-c004-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 FunctionPointer-PT-c004-LTLFireability-13
lola: time limit : 877 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for FunctionPointer-PT-c004-LTLFireability-13
lola: result : true
lola: markings : 23
lola: fired transitions : 34
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 FunctionPointer-PT-c004-LTLFireability-09
lola: time limit : 1170 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1170 6/32 FunctionPointer-PT-c004-LTLFireability-09 555645 m, 111129 m/sec, 880087 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1170 11/32 FunctionPointer-PT-c004-LTLFireability-09 1104658 m, 109802 m/sec, 1749692 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1170 17/32 FunctionPointer-PT-c004-LTLFireability-09 1651779 m, 109424 m/sec, 2616296 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1170 22/32 FunctionPointer-PT-c004-LTLFireability-09 2198052 m, 109254 m/sec, 3481565 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1170 28/32 FunctionPointer-PT-c004-LTLFireability-09 2744450 m, 109279 m/sec, 4347024 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for FunctionPointer-PT-c004-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-c004-LTLFireability-04
lola: time limit : 1740 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1740 6/32 FunctionPointer-PT-c004-LTLFireability-04 552260 m, 110452 m/sec, 874725 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1740 11/32 FunctionPointer-PT-c004-LTLFireability-04 1097712 m, 109090 m/sec, 1738687 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1740 17/32 FunctionPointer-PT-c004-LTLFireability-04 1642180 m, 108893 m/sec, 2601093 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1740 22/32 FunctionPointer-PT-c004-LTLFireability-04 2184945 m, 108553 m/sec, 3460799 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1740 28/32 FunctionPointer-PT-c004-LTLFireability-04 2727949 m, 108600 m/sec, 4320891 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-c004-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 FunctionPointer-PT-c004-LTLFireability-07
lola: time limit : 3450 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3450 1/32 FunctionPointer-PT-c004-LTLFireability-07 21284 m, 4256 m/sec, 26595 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3450 1/32 FunctionPointer-PT-c004-LTLFireability-07 42559 m, 4255 m/sec, 53189 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3450 1/32 FunctionPointer-PT-c004-LTLFireability-07 63822 m, 4252 m/sec, 79768 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3450 2/32 FunctionPointer-PT-c004-LTLFireability-07 85091 m, 4253 m/sec, 106354 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/3450 2/32 FunctionPointer-PT-c004-LTLFireability-07 106364 m, 4254 m/sec, 132945 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/3450 2/32 FunctionPointer-PT-c004-LTLFireability-07 127626 m, 4252 m/sec, 159523 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/3450 2/32 FunctionPointer-PT-c004-LTLFireability-07 148841 m, 4243 m/sec, 186041 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/3450 3/32 FunctionPointer-PT-c004-LTLFireability-07 170022 m, 4236 m/sec, 212518 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/3450 3/32 FunctionPointer-PT-c004-LTLFireability-07 191279 m, 4251 m/sec, 239089 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/3450 3/32 FunctionPointer-PT-c004-LTLFireability-07 212122 m, 4168 m/sec, 265143 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/3450 4/32 FunctionPointer-PT-c004-LTLFireability-07 232892 m, 4154 m/sec, 291105 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 61/3450 4/32 FunctionPointer-PT-c004-LTLFireability-07 253882 m, 4198 m/sec, 317343 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 66/3450 4/32 FunctionPointer-PT-c004-LTLFireability-07 275129 m, 4249 m/sec, 343901 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 71/3450 4/32 FunctionPointer-PT-c004-LTLFireability-07 296283 m, 4230 m/sec, 370344 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 76/3450 5/32 FunctionPointer-PT-c004-LTLFireability-07 317357 m, 4214 m/sec, 396686 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 81/3450 5/32 FunctionPointer-PT-c004-LTLFireability-07 338606 m, 4249 m/sec, 423248 t fired, .

Time elapsed: 231 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 86/3450 5/32 FunctionPointer-PT-c004-LTLFireability-07 359867 m, 4252 m/sec, 449824 t fired, .

Time elapsed: 236 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 91/3450 5/32 FunctionPointer-PT-c004-LTLFireability-07 380998 m, 4226 m/sec, 476238 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 96/3450 6/32 FunctionPointer-PT-c004-LTLFireability-07 402039 m, 4208 m/sec, 502539 t fired, .

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 101/3450 6/32 FunctionPointer-PT-c004-LTLFireability-07 423263 m, 4244 m/sec, 529069 t fired, .

Time elapsed: 251 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 106/3450 6/32 FunctionPointer-PT-c004-LTLFireability-07 444260 m, 4199 m/sec, 555315 t fired, .

Time elapsed: 256 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 111/3450 7/32 FunctionPointer-PT-c004-LTLFireability-07 465338 m, 4215 m/sec, 581663 t fired, .

Time elapsed: 261 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 116/3450 7/32 FunctionPointer-PT-c004-LTLFireability-07 486516 m, 4235 m/sec, 608136 t fired, .

Time elapsed: 266 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 121/3450 7/32 FunctionPointer-PT-c004-LTLFireability-07 507606 m, 4218 m/sec, 634498 t fired, .

Time elapsed: 271 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 126/3450 7/32 FunctionPointer-PT-c004-LTLFireability-07 528850 m, 4248 m/sec, 661053 t fired, .

Time elapsed: 276 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 131/3450 8/32 FunctionPointer-PT-c004-LTLFireability-07 550090 m, 4248 m/sec, 687603 t fired, .

Time elapsed: 281 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 136/3450 8/32 FunctionPointer-PT-c004-LTLFireability-07 571337 m, 4249 m/sec, 714161 t fired, .

Time elapsed: 286 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 141/3450 8/32 FunctionPointer-PT-c004-LTLFireability-07 592582 m, 4249 m/sec, 740718 t fired, .

Time elapsed: 291 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 146/3450 8/32 FunctionPointer-PT-c004-LTLFireability-07 613828 m, 4249 m/sec, 767275 t fired, .

Time elapsed: 296 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 151/3450 9/32 FunctionPointer-PT-c004-LTLFireability-07 635063 m, 4247 m/sec, 793819 t fired, .

Time elapsed: 301 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 156/3450 9/32 FunctionPointer-PT-c004-LTLFireability-07 656305 m, 4248 m/sec, 820372 t fired, .

Time elapsed: 306 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 161/3450 9/32 FunctionPointer-PT-c004-LTLFireability-07 677554 m, 4249 m/sec, 846933 t fired, .

Time elapsed: 311 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 166/3450 10/32 FunctionPointer-PT-c004-LTLFireability-07 698798 m, 4248 m/sec, 873488 t fired, .

Time elapsed: 316 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 171/3450 10/32 FunctionPointer-PT-c004-LTLFireability-07 720050 m, 4250 m/sec, 900053 t fired, .

Time elapsed: 321 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 176/3450 10/32 FunctionPointer-PT-c004-LTLFireability-07 741319 m, 4253 m/sec, 926639 t fired, .

Time elapsed: 326 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 181/3450 10/32 FunctionPointer-PT-c004-LTLFireability-07 762595 m, 4255 m/sec, 953234 t fired, .

Time elapsed: 331 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 186/3450 11/32 FunctionPointer-PT-c004-LTLFireability-07 783761 m, 4233 m/sec, 979691 t fired, .

Time elapsed: 336 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 191/3450 11/32 FunctionPointer-PT-c004-LTLFireability-07 804665 m, 4180 m/sec, 1005821 t fired, .

Time elapsed: 341 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 196/3450 11/32 FunctionPointer-PT-c004-LTLFireability-07 825530 m, 4173 m/sec, 1031903 t fired, .

Time elapsed: 346 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 201/3450 11/32 FunctionPointer-PT-c004-LTLFireability-07 846435 m, 4181 m/sec, 1058034 t fired, .

Time elapsed: 351 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 206/3450 12/32 FunctionPointer-PT-c004-LTLFireability-07 867332 m, 4179 m/sec, 1084155 t fired, .

Time elapsed: 356 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 211/3450 12/32 FunctionPointer-PT-c004-LTLFireability-07 888198 m, 4173 m/sec, 1110238 t fired, .

Time elapsed: 361 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 216/3450 12/32 FunctionPointer-PT-c004-LTLFireability-07 908882 m, 4136 m/sec, 1136093 t fired, .

Time elapsed: 366 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 221/3450 13/32 FunctionPointer-PT-c004-LTLFireability-07 929618 m, 4147 m/sec, 1162013 t fired, .

Time elapsed: 371 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 226/3450 13/32 FunctionPointer-PT-c004-LTLFireability-07 950358 m, 4148 m/sec, 1187938 t fired, .

Time elapsed: 376 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 231/3450 13/32 FunctionPointer-PT-c004-LTLFireability-07 971078 m, 4144 m/sec, 1213838 t fired, .

Time elapsed: 381 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 236/3450 13/32 FunctionPointer-PT-c004-LTLFireability-07 991757 m, 4135 m/sec, 1239686 t fired, .

Time elapsed: 386 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 241/3450 14/32 FunctionPointer-PT-c004-LTLFireability-07 1012436 m, 4135 m/sec, 1265535 t fired, .

Time elapsed: 391 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 246/3450 14/32 FunctionPointer-PT-c004-LTLFireability-07 1033161 m, 4145 m/sec, 1291442 t fired, .

Time elapsed: 396 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 251/3450 14/32 FunctionPointer-PT-c004-LTLFireability-07 1053814 m, 4130 m/sec, 1317258 t fired, .

Time elapsed: 401 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 256/3450 14/32 FunctionPointer-PT-c004-LTLFireability-07 1075050 m, 4247 m/sec, 1343803 t fired, .

Time elapsed: 406 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 261/3450 15/32 FunctionPointer-PT-c004-LTLFireability-07 1096258 m, 4241 m/sec, 1370313 t fired, .

Time elapsed: 411 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 266/3450 15/32 FunctionPointer-PT-c004-LTLFireability-07 1117431 m, 4234 m/sec, 1396779 t fired, .

Time elapsed: 416 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 271/3450 15/32 FunctionPointer-PT-c004-LTLFireability-07 1138548 m, 4223 m/sec, 1423176 t fired, .

Time elapsed: 421 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 276/3450 16/32 FunctionPointer-PT-c004-LTLFireability-07 1159665 m, 4223 m/sec, 1449572 t fired, .

Time elapsed: 426 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 281/3450 16/32 FunctionPointer-PT-c004-LTLFireability-07 1180815 m, 4230 m/sec, 1476009 t fired, .

Time elapsed: 431 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 286/3450 16/32 FunctionPointer-PT-c004-LTLFireability-07 1201968 m, 4230 m/sec, 1502451 t fired, .

Time elapsed: 436 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 291/3450 16/32 FunctionPointer-PT-c004-LTLFireability-07 1223073 m, 4221 m/sec, 1528832 t fired, .

Time elapsed: 441 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 296/3450 17/32 FunctionPointer-PT-c004-LTLFireability-07 1244211 m, 4227 m/sec, 1555254 t fired, .

Time elapsed: 446 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 301/3450 17/32 FunctionPointer-PT-c004-LTLFireability-07 1265367 m, 4231 m/sec, 1581699 t fired, .

Time elapsed: 451 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 306/3450 17/32 FunctionPointer-PT-c004-LTLFireability-07 1286533 m, 4233 m/sec, 1608157 t fired, .

Time elapsed: 456 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 311/3450 17/32 FunctionPointer-PT-c004-LTLFireability-07 1307646 m, 4222 m/sec, 1634548 t fired, .

Time elapsed: 461 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 316/3450 18/32 FunctionPointer-PT-c004-LTLFireability-07 1328813 m, 4233 m/sec, 1661006 t fired, .

Time elapsed: 466 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 321/3450 18/32 FunctionPointer-PT-c004-LTLFireability-07 1349935 m, 4224 m/sec, 1687409 t fired, .

Time elapsed: 471 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 326/3450 18/32 FunctionPointer-PT-c004-LTLFireability-07 1371055 m, 4224 m/sec, 1713809 t fired, .

Time elapsed: 476 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 331/3450 19/32 FunctionPointer-PT-c004-LTLFireability-07 1392237 m, 4236 m/sec, 1740287 t fired, .

Time elapsed: 481 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 336/3450 19/32 FunctionPointer-PT-c004-LTLFireability-07 1413402 m, 4233 m/sec, 1766743 t fired, .

Time elapsed: 486 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 341/3450 19/32 FunctionPointer-PT-c004-LTLFireability-07 1434518 m, 4223 m/sec, 1793138 t fired, .

Time elapsed: 491 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 346/3450 19/32 FunctionPointer-PT-c004-LTLFireability-07 1455670 m, 4230 m/sec, 1819578 t fired, .

Time elapsed: 496 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 351/3450 20/32 FunctionPointer-PT-c004-LTLFireability-07 1476837 m, 4233 m/sec, 1846037 t fired, .

Time elapsed: 501 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 356/3450 20/32 FunctionPointer-PT-c004-LTLFireability-07 1498002 m, 4233 m/sec, 1872493 t fired, .

Time elapsed: 506 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 361/3450 20/32 FunctionPointer-PT-c004-LTLFireability-07 1519147 m, 4229 m/sec, 1898924 t fired, .

Time elapsed: 511 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 366/3450 20/32 FunctionPointer-PT-c004-LTLFireability-07 1540326 m, 4235 m/sec, 1925398 t fired, .

Time elapsed: 516 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 371/3450 21/32 FunctionPointer-PT-c004-LTLFireability-07 1561468 m, 4228 m/sec, 1951825 t fired, .

Time elapsed: 521 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 376/3450 21/32 FunctionPointer-PT-c004-LTLFireability-07 1582676 m, 4241 m/sec, 1978335 t fired, .

Time elapsed: 526 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 381/3450 21/32 FunctionPointer-PT-c004-LTLFireability-07 1603715 m, 4207 m/sec, 2004634 t fired, .

Time elapsed: 531 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 386/3450 22/32 FunctionPointer-PT-c004-LTLFireability-07 1624965 m, 4250 m/sec, 2031197 t fired, .

Time elapsed: 536 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 391/3450 22/32 FunctionPointer-PT-c004-LTLFireability-07 1646218 m, 4250 m/sec, 2057763 t fired, .

Time elapsed: 541 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 396/3450 22/32 FunctionPointer-PT-c004-LTLFireability-07 1667470 m, 4250 m/sec, 2084328 t fired, .

Time elapsed: 546 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 401/3450 22/32 FunctionPointer-PT-c004-LTLFireability-07 1688723 m, 4250 m/sec, 2110894 t fired, .

Time elapsed: 551 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 406/3450 23/32 FunctionPointer-PT-c004-LTLFireability-07 1709969 m, 4249 m/sec, 2137451 t fired, .

Time elapsed: 556 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 411/3450 23/32 FunctionPointer-PT-c004-LTLFireability-07 1731223 m, 4250 m/sec, 2164019 t fired, .

Time elapsed: 561 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 416/3450 23/32 FunctionPointer-PT-c004-LTLFireability-07 1752474 m, 4250 m/sec, 2190583 t fired, .

Time elapsed: 566 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 421/3450 24/32 FunctionPointer-PT-c004-LTLFireability-07 1773712 m, 4247 m/sec, 2217130 t fired, .

Time elapsed: 571 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 426/3450 24/32 FunctionPointer-PT-c004-LTLFireability-07 1794962 m, 4250 m/sec, 2243693 t fired, .

Time elapsed: 576 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 431/3450 24/32 FunctionPointer-PT-c004-LTLFireability-07 1816216 m, 4250 m/sec, 2270260 t fired, .

Time elapsed: 581 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 436/3450 24/32 FunctionPointer-PT-c004-LTLFireability-07 1837468 m, 4250 m/sec, 2296825 t fired, .

Time elapsed: 586 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 441/3450 25/32 FunctionPointer-PT-c004-LTLFireability-07 1858710 m, 4248 m/sec, 2323378 t fired, .

Time elapsed: 591 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 446/3450 25/32 FunctionPointer-PT-c004-LTLFireability-07 1879955 m, 4249 m/sec, 2349934 t fired, .

Time elapsed: 596 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 451/3450 25/32 FunctionPointer-PT-c004-LTLFireability-07 1901201 m, 4249 m/sec, 2376491 t fired, .

Time elapsed: 601 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 456/3450 25/32 FunctionPointer-PT-c004-LTLFireability-07 1922444 m, 4248 m/sec, 2403045 t fired, .

Time elapsed: 606 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 461/3450 26/32 FunctionPointer-PT-c004-LTLFireability-07 1943691 m, 4249 m/sec, 2429604 t fired, .

Time elapsed: 611 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 466/3450 26/32 FunctionPointer-PT-c004-LTLFireability-07 1964924 m, 4246 m/sec, 2456145 t fired, .

Time elapsed: 616 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 471/3450 26/32 FunctionPointer-PT-c004-LTLFireability-07 1986154 m, 4246 m/sec, 2482683 t fired, .

Time elapsed: 621 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 476/3450 27/32 FunctionPointer-PT-c004-LTLFireability-07 2007387 m, 4246 m/sec, 2509224 t fired, .

Time elapsed: 626 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 481/3450 27/32 FunctionPointer-PT-c004-LTLFireability-07 2028599 m, 4242 m/sec, 2535739 t fired, .

Time elapsed: 631 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 486/3450 27/32 FunctionPointer-PT-c004-LTLFireability-07 2049838 m, 4247 m/sec, 2562288 t fired, .

Time elapsed: 636 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 491/3450 27/32 FunctionPointer-PT-c004-LTLFireability-07 2071066 m, 4245 m/sec, 2588823 t fired, .

Time elapsed: 641 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 496/3450 28/32 FunctionPointer-PT-c004-LTLFireability-07 2092289 m, 4244 m/sec, 2615351 t fired, .

Time elapsed: 646 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 501/3450 28/32 FunctionPointer-PT-c004-LTLFireability-07 2113505 m, 4243 m/sec, 2641871 t fired, .

Time elapsed: 651 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 506/3450 28/32 FunctionPointer-PT-c004-LTLFireability-07 2134719 m, 4242 m/sec, 2668389 t fired, .

Time elapsed: 656 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 511/3450 28/32 FunctionPointer-PT-c004-LTLFireability-07 2155954 m, 4247 m/sec, 2694933 t fired, .

Time elapsed: 661 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 516/3450 29/32 FunctionPointer-PT-c004-LTLFireability-07 2177194 m, 4248 m/sec, 2721483 t fired, .

Time elapsed: 666 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 521/3450 29/32 FunctionPointer-PT-c004-LTLFireability-07 2198425 m, 4246 m/sec, 2748022 t fired, .

Time elapsed: 671 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 526/3450 29/32 FunctionPointer-PT-c004-LTLFireability-07 2219676 m, 4250 m/sec, 2774586 t fired, .

Time elapsed: 676 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 531/3450 30/32 FunctionPointer-PT-c004-LTLFireability-07 2240864 m, 4237 m/sec, 2801070 t fired, .

Time elapsed: 681 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 536/3450 30/32 FunctionPointer-PT-c004-LTLFireability-07 2261954 m, 4218 m/sec, 2827433 t fired, .

Time elapsed: 686 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 541/3450 30/32 FunctionPointer-PT-c004-LTLFireability-07 2283066 m, 4222 m/sec, 2853823 t fired, .

Time elapsed: 691 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 546/3450 30/32 FunctionPointer-PT-c004-LTLFireability-07 2304189 m, 4224 m/sec, 2880227 t fired, .

Time elapsed: 696 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 551/3450 31/32 FunctionPointer-PT-c004-LTLFireability-07 2325345 m, 4231 m/sec, 2906672 t fired, .

Time elapsed: 701 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 556/3450 31/32 FunctionPointer-PT-c004-LTLFireability-07 2346521 m, 4235 m/sec, 2933143 t fired, .

Time elapsed: 706 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 561/3450 31/32 FunctionPointer-PT-c004-LTLFireability-07 2367666 m, 4229 m/sec, 2959573 t fired, .

Time elapsed: 711 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 566/3450 31/32 FunctionPointer-PT-c004-LTLFireability-07 2388830 m, 4232 m/sec, 2986028 t fired, .

Time elapsed: 716 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 571/3450 32/32 FunctionPointer-PT-c004-LTLFireability-07 2410021 m, 4238 m/sec, 3012517 t fired, .

Time elapsed: 721 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 576/3450 32/32 FunctionPointer-PT-c004-LTLFireability-07 2431156 m, 4227 m/sec, 3038935 t fired, .

Time elapsed: 726 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 581/3450 32/32 FunctionPointer-PT-c004-LTLFireability-07 2452286 m, 4226 m/sec, 3065348 t fired, .

Time elapsed: 731 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for FunctionPointer-PT-c004-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c004-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c004-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c004-LTLFireability-00: LTL unknown AGGR
FunctionPointer-PT-c004-LTLFireability-04: LTL unknown AGGR
FunctionPointer-PT-c004-LTLFireability-07: LTL unknown AGGR
FunctionPointer-PT-c004-LTLFireability-09: LTL unknown AGGR
FunctionPointer-PT-c004-LTLFireability-13: LTL true LTL model checker


Time elapsed: 736 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-c004, 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 r167-tall-167838853500724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;