fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838856300724
Last Updated
May 14, 2023

About the Execution of LTSMin+red for FunctionPointer-PT-c004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1342.504 399495.00 514395.00 1573.50 ?TFF?FF?F?FTF?FF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:39:22] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2023-03-12 13:39:22] [INFO ] Transformed 2826 places.
[2023-03-12 13:39:22] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:39:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 535 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 30 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 1297 ms. Remains 740 /1628 variables (removed 888) and now considering 1928/5962 (removed 4034) transitions.
[2023-03-12 13:39:23] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
// Phase 1: matrix 1291 rows 740 cols
[2023-03-12 13:39:23] [INFO ] Computed 2 place invariants in 38 ms
[2023-03-12 13:39:24] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-12 13:39:24] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-12 13:39:24] [INFO ] Invariant cache hit.
[2023-03-12 13:39:24] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-12 13:39:26] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
[2023-03-12 13:39:26] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-12 13:39:26] [INFO ] Invariant cache hit.
[2023-03-12 13:39:26] [INFO ] Dead Transitions using invariants and state equation in 667 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 4494 ms. Remains : 740/1628 places, 1928/5962 transitions.
Support contains 22 out of 740 places after structural reductions.
[2023-03-12 13:39:27] [INFO ] Flatten gal took : 141 ms
[2023-03-12 13:39:27] [INFO ] Flatten gal took : 96 ms
[2023-03-12 13:39:27] [INFO ] Input system was already deterministic with 1928 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) 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 19) 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 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 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) seen :0
Interrupted probabilistic random walk after 128667 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128667 steps, saw 83535 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 19 properties.
[2023-03-12 13:39:31] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-12 13:39:31] [INFO ] Invariant cache hit.
[2023-03-12 13:39:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:39:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:39:32] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-12 13:39:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:39:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:39:35] [INFO ] After 2691ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-12 13:39:35] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-12 13:39:37] [INFO ] After 1947ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :1 sat :18
[2023-03-12 13:39:38] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 4 ms to minimize.
[2023-03-12 13:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-12 13:39:39] [INFO ] After 4448ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 1442 ms.
[2023-03-12 13:39:41] [INFO ] After 9101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 20 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 383 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 383 ms. Remains : 740/740 places, 1896/1928 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) 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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 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 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-12 13:39:42] [INFO ] Flow matrix only has 1275 transitions (discarded 621 similar events)
// Phase 1: matrix 1275 rows 740 cols
[2023-03-12 13:39:42] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:39:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:39:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:39:43] [INFO ] After 1272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 13:39:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:39:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:39:46] [INFO ] After 2343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 13:39:46] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-12 13:39:48] [INFO ] After 2036ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 13:39:48] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2023-03-12 13:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-12 13:39:50] [INFO ] After 4136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2023-03-12 13:39:51] [INFO ] After 8148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 154 ms.
Support contains 18 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1896/1896 transitions.
Applied a total of 0 rules in 118 ms. Remains 740 /740 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 740/740 places, 1896/1896 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) 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 14) 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 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 13:39:52] [INFO ] Flow matrix only has 1275 transitions (discarded 621 similar events)
[2023-03-12 13:39:52] [INFO ] Invariant cache hit.
[2023-03-12 13:39:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:39:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:39:54] [INFO ] After 1962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 13:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:39:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:39:56] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 13:39:56] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-12 13:39:57] [INFO ] After 1229ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 13:39:57] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 1 ms to minimize.
[2023-03-12 13:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-12 13:39:57] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 1 ms to minimize.
[2023-03-12 13:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-12 13:39:59] [INFO ] After 2922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 763 ms.
[2023-03-12 13:39:59] [INFO ] After 5290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 59 ms.
Support contains 13 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1896/1896 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 735 transition count 1886
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 735 transition count 1886
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 730 transition count 1876
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 730 transition count 1876
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 725 transition count 1856
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 725 transition count 1856
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 720 transition count 1846
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 720 transition count 1846
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 715 transition count 1836
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 715 transition count 1836
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 710 transition count 1826
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 710 transition count 1826
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 705 transition count 1816
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 705 transition count 1816
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 700 transition count 1806
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 700 transition count 1806
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 695 transition count 1796
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 695 transition count 1796
Applied a total of 90 rules in 291 ms. Remains 695 /740 variables (removed 45) and now considering 1796/1896 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 695/740 places, 1796/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
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 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 13:40:00] [INFO ] Flow matrix only has 1205 transitions (discarded 591 similar events)
// Phase 1: matrix 1205 rows 695 cols
[2023-03-12 13:40:00] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:40:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:40:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:02] [INFO ] After 1575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 13:40:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:03] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:03] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-12 13:40:04] [INFO ] After 1175ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:04] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 1 ms to minimize.
[2023-03-12 13:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-12 13:40:05] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 1 ms to minimize.
[2023-03-12 13:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-12 13:40:05] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 0 ms to minimize.
[2023-03-12 13:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-12 13:40:06] [INFO ] After 2857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 651 ms.
[2023-03-12 13:40:07] [INFO ] After 4812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 14 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 242 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 242 ms. Remains : 686/695 places, 1774/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) 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 9) 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 9) 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 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 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 24 ms. (steps per millisecond=416 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 147136 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147136 steps, saw 95523 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-12 13:40:10] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
// Phase 1: matrix 1190 rows 686 cols
[2023-03-12 13:40:10] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:40:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:40:12] [INFO ] After 1538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 13:40:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:13] [INFO ] After 1058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:13] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-12 13:40:14] [INFO ] After 1026ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:14] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2023-03-12 13:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-12 13:40:15] [INFO ] After 2330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 982 ms.
[2023-03-12 13:40:16] [INFO ] After 4662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 40 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 99 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 114 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 95 ms. Remains 686 /686 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2023-03-12 13:40:17] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-12 13:40:17] [INFO ] Invariant cache hit.
[2023-03-12 13:40:17] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-12 13:40:17] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-12 13:40:17] [INFO ] Invariant cache hit.
[2023-03-12 13:40:17] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-12 13:40:19] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-12 13:40:19] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-12 13:40:19] [INFO ] Flow matrix only has 1190 transitions (discarded 584 similar events)
[2023-03-12 13:40:19] [INFO ] Invariant cache hit.
[2023-03-12 13:40:20] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3016 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 5 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 1 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 1 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 1 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 89 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-12 13:40:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:20] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-12 13:40:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:40:20] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 13:40:20] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:40:20] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:20] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:20] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-12 13:40:20] [INFO ] After 246ms 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 468 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-12 13:40:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 13:40:21] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 13:40:21] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 13:40:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:21] [INFO ] Invariant cache hit.
[2023-03-12 13:40:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:22] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
[2023-03-12 13:40:23] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-12 13:40:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:23] [INFO ] Invariant cache hit.
[2023-03-12 13:40:23] [INFO ] Dead Transitions using invariants and state equation in 512 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 2889 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 188 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 550 ms.
Product exploration explored 100000 steps with 0 reset in 512 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 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481896 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481896 steps, saw 312783 distinct states, run finished after 3002 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:40:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:28] [INFO ] Invariant cache hit.
[2023-03-12 13:40:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:40:28] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:29] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:29] [INFO ] After 201ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:29] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 13:40:29] [INFO ] After 866ms 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 50 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 50 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10001 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 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 571012 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 571012 steps, saw 350137 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:40:32] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2023-03-12 13:40:32] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-12 13:40:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:32] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:33] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:40:33] [INFO ] After 123ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:33] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-12 13:40:33] [INFO ] After 695ms 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 49 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 49 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 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2023-03-12 13:40:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:33] [INFO ] Invariant cache hit.
[2023-03-12 13:40:33] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-12 13:40:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:33] [INFO ] Invariant cache hit.
[2023-03-12 13:40:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:40:34] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-12 13:40:34] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 13:40:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:34] [INFO ] Invariant cache hit.
[2023-03-12 13:40:35] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 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 0 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 1 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-12 13:40:35] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 13:40:35] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:35] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 13:40:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:40:35] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:35] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:35] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:35] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:35] [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-12 13:40:35] [INFO ] After 37ms 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 221 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 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 88 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 13:40:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 13:40:35] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:40:36] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-12 13:40:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:36] [INFO ] Invariant cache hit.
[2023-03-12 13:40:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:37] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2023-03-12 13:40:37] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 13:40:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:37] [INFO ] Invariant cache hit.
[2023-03-12 13:40:37] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2314 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 121 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 88 ms :[(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
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 503580 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503580 steps, saw 326856 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:40:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:41] [INFO ] Invariant cache hit.
[2023-03-12 13:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:41] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:40:42] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:42] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:42] [INFO ] After 212ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:42] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 13:40:42] [INFO ] After 845ms 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 48 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 49 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10001 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 609026 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 609026 steps, saw 373444 distinct states, run finished after 3002 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:40:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2023-03-12 13:40:45] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:40:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:40:45] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:40:46] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:40:46] [INFO ] After 130ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:46] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-12 13:40:46] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 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 47 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 47 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 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2023-03-12 13:40:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:46] [INFO ] Invariant cache hit.
[2023-03-12 13:40:46] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-12 13:40:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:46] [INFO ] Invariant cache hit.
[2023-03-12 13:40:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:40:47] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-12 13:40:47] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 13:40:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-12 13:40:47] [INFO ] Invariant cache hit.
[2023-03-12 13:40:48] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1446 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 1 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 24 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-12 13:40:48] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-12 13:40:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 13:40:48] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 13:40:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:40:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:48] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:40:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:48] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:48] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:40:48] [INFO ] After 6ms 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-12 13:40:48] [INFO ] After 38ms 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 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 453 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 79 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-12 13:40:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 13:40:49] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:40:49] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-12 13:40:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:49] [INFO ] Invariant cache hit.
[2023-03-12 13:40:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:51] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
[2023-03-12 13:40:51] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 13:40:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:51] [INFO ] Invariant cache hit.
[2023-03-12 13:40:51] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2385 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-00 finished in 31224 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 305 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-12 13:40:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:52] [INFO ] Invariant cache hit.
[2023-03-12 13:40:52] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-12 13:40:52] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:52] [INFO ] Invariant cache hit.
[2023-03-12 13:40:52] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 13:40:53] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2023-03-12 13:40:53] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 13:40:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 13:40:53] [INFO ] Invariant cache hit.
[2023-03-12 13:40:54] [INFO ] Dead Transitions using invariants and state equation in 483 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 2542 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 64 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 388 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 1 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 129 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-12 13:40:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:40:55] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 13:40:55] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 13:40:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:40:55] [INFO ] Invariant cache hit.
[2023-03-12 13:40:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:40:56] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-12 13:40:56] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:40:56] [INFO ] Invariant cache hit.
[2023-03-12 13:40:57] [INFO ] Dead Transitions using invariants and state equation in 521 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 2445 ms. Remains : 633/740 places, 1656/1928 transitions.
Stuttering acceptance computed with spot in 122 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 441 ms.
Product exploration explored 100000 steps with 0 reset in 502 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 539 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 103 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 132 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 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 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 39 ms. (steps per millisecond=256 ) 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
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 201629 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201629 steps, saw 130888 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:41:02] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:02] [INFO ] Invariant cache hit.
[2023-03-12 13:41:02] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:03] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:04] [INFO ] After 1390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:05] [INFO ] After 1331ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:06] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 1 ms to minimize.
[2023-03-12 13:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-12 13:41:07] [INFO ] After 2689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2023-03-12 13:41:08] [INFO ] After 5354ms 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 161 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 162 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) 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 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 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 200261 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200261 steps, saw 129999 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:41:11] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-12 13:41:11] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:41:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:12] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:14] [INFO ] After 1444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:14] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:15] [INFO ] After 1215ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:15] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2023-03-12 13:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-12 13:41:16] [INFO ] After 2545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 728 ms.
[2023-03-12 13:41:17] [INFO ] After 4913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 30 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 78 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 78 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 76 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-12 13:41:17] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:17] [INFO ] Invariant cache hit.
[2023-03-12 13:41:17] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-12 13:41:17] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:17] [INFO ] Invariant cache hit.
[2023-03-12 13:41:18] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:19] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2023-03-12 13:41:19] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 13:41:19] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:19] [INFO ] Invariant cache hit.
[2023-03-12 13:41:20] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2681 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 1 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 31 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-12 13:41:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:41:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:41:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:41:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:20] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:41:20] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:20] [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-12 13:41:20] [INFO ] After 129ms 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 527 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 127 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 217 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 13 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-12 13:41:21] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:41:21] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 13:41:21] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 13:41:21] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:21] [INFO ] Invariant cache hit.
[2023-03-12 13:41:21] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:23] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-03-12 13:41:23] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:23] [INFO ] Invariant cache hit.
[2023-03-12 13:41:23] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2731 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 547 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 126 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 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) 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 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 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 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 204322 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204322 steps, saw 132634 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:41:27] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:27] [INFO ] Invariant cache hit.
[2023-03-12 13:41:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 13:41:28] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:41:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:30] [INFO ] After 1728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:30] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:31] [INFO ] After 1377ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:32] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-12 13:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-12 13:41:33] [INFO ] After 2721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1123 ms.
[2023-03-12 13:41:34] [INFO ] After 5807ms 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 24 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 148 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) 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 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 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 203250 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203250 steps, saw 131940 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:41:37] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-12 13:41:37] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:41:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:38] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:40] [INFO ] After 1363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:40] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:41] [INFO ] After 1136ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:41] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 1 ms to minimize.
[2023-03-12 13:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-12 13:41:42] [INFO ] After 2406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 746 ms.
[2023-03-12 13:41:43] [INFO ] After 4702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 26 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 80 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 80 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 78 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-12 13:41:43] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:43] [INFO ] Invariant cache hit.
[2023-03-12 13:41:43] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 13:41:43] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:43] [INFO ] Invariant cache hit.
[2023-03-12 13:41:44] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:45] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
[2023-03-12 13:41:45] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 13:41:45] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:41:45] [INFO ] Invariant cache hit.
[2023-03-12 13:41:45] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2623 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 31 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-12 13:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:41:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:41:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:46] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:41:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:41:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:41:46] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:41:46] [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-12 13:41:46] [INFO ] After 134ms 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 505 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 122 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 133 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 122 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 414 ms.
Product exploration explored 100000 steps with 0 reset in 573 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 16 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-12 13:41:48] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:41:48] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 13:41:48] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 13:41:48] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:48] [INFO ] Invariant cache hit.
[2023-03-12 13:41:49] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:41:50] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2023-03-12 13:41:50] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:41:50] [INFO ] Invariant cache hit.
[2023-03-12 13:41:50] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2640 ms. Remains : 633/633 places, 1656/1656 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 56075 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 121 ms. Remains 606 /740 variables (removed 134) and now considering 1588/1928 (removed 340) transitions.
[2023-03-12 13:41:51] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2023-03-12 13:41:51] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:41:51] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-12 13:41:51] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-12 13:41:51] [INFO ] Invariant cache hit.
[2023-03-12 13:41:51] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-12 13:41:53] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2023-03-12 13:41:53] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-12 13:41:53] [INFO ] Invariant cache hit.
[2023-03-12 13:41:53] [INFO ] Dead Transitions using invariants and state equation in 529 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 2659 ms. Remains : 606/740 places, 1588/1928 transitions.
Stuttering acceptance computed with spot in 89 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 2769 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 304 ms. Remains 641 /740 variables (removed 99) and now considering 1670/1928 (removed 258) transitions.
[2023-03-12 13:41:54] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-12 13:41:54] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:41:54] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-12 13:41:54] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:41:54] [INFO ] Invariant cache hit.
[2023-03-12 13:41:54] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:41:56] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2023-03-12 13:41:56] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 13:41:56] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:41:56] [INFO ] Invariant cache hit.
[2023-03-12 13:41:56] [INFO ] Dead Transitions using invariants and state equation in 525 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 2783 ms. Remains : 641/740 places, 1670/1928 transitions.
Stuttering acceptance computed with spot in 151 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 546 ms.
Product exploration explored 100000 steps with 0 reset in 530 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 515 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 147 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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 29 ms. (steps per millisecond=344 ) 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 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
Interrupted probabilistic random walk after 199069 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199069 steps, saw 129228 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:42:01] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:01] [INFO ] Invariant cache hit.
[2023-03-12 13:42:01] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:42:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-12 13:42:01] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:03] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:03] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:04] [INFO ] After 1056ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:04] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 0 ms to minimize.
[2023-03-12 13:42:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-12 13:42:05] [INFO ] After 2086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 713 ms.
[2023-03-12 13:42:06] [INFO ] After 4256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 15 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 74 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 74 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 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 30 ms. (steps per millisecond=333 ) 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 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 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 188663 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188663 steps, saw 122474 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:42:09] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:09] [INFO ] Invariant cache hit.
[2023-03-12 13:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:09] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:42:11] [INFO ] After 1201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:11] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:12] [INFO ] After 986ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:12] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 0 ms to minimize.
[2023-03-12 13:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-12 13:42:13] [INFO ] After 1957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-12 13:42:13] [INFO ] After 4053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 13 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 74 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-12 13:42:14] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:14] [INFO ] Invariant cache hit.
[2023-03-12 13:42:14] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 13:42:14] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:14] [INFO ] Invariant cache hit.
[2023-03-12 13:42:14] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:15] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2023-03-12 13:42:15] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 13:42:15] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:15] [INFO ] Invariant cache hit.
[2023-03-12 13:42:16] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2515 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 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 30 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-12 13:42:16] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 13:42:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:42:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:42:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:42:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:42:16] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:42:16] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:16] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 13:42:16] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
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 533 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)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-12 13:42:17] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-12 13:42:17] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:42:18] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:42:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:42:19] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2023-03-12 13:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2023-03-12 13:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:42:20] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-12 13:42:20] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:20] [INFO ] [Nat]Added 274 Read/Feed constraints in 98 ms returned sat
[2023-03-12 13:42:21] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 202 ms.
[2023-03-12 13:42:21] [INFO ] Added : 10 causal constraints over 2 iterations in 421 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 84 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-12 13:42:21] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:21] [INFO ] Invariant cache hit.
[2023-03-12 13:42:21] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 13:42:21] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:21] [INFO ] Invariant cache hit.
[2023-03-12 13:42:22] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:23] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-12 13:42:23] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 13:42:23] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:23] [INFO ] Invariant cache hit.
[2023-03-12 13:42:24] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2643 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 520 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 134 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) 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 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 30 ms. (steps per millisecond=333 ) 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
Interrupted probabilistic random walk after 189842 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189842 steps, saw 123237 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:42:28] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:28] [INFO ] Invariant cache hit.
[2023-03-12 13:42:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:28] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:42:29] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:29] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:30] [INFO ] After 1003ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:30] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 0 ms to minimize.
[2023-03-12 13:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-12 13:42:31] [INFO ] After 1991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 670 ms.
[2023-03-12 13:42:32] [INFO ] After 4038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 14 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 69 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 71 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 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 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 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 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 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 188785 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188785 steps, saw 122551 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:42:35] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:35] [INFO ] Invariant cache hit.
[2023-03-12 13:42:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:35] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:42:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:37] [INFO ] After 1180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:37] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:38] [INFO ] After 1015ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:38] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-12 13:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-12 13:42:39] [INFO ] After 1975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 670 ms.
[2023-03-12 13:42:39] [INFO ] After 4010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12 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 71 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.
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.
[2023-03-12 13:42:39] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:39] [INFO ] Invariant cache hit.
[2023-03-12 13:42:40] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-12 13:42:40] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:40] [INFO ] Invariant cache hit.
[2023-03-12 13:42:40] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:41] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2023-03-12 13:42:41] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 13:42:41] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:41] [INFO ] Invariant cache hit.
[2023-03-12 13:42:42] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2514 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 29 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-12 13:42:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:42:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:42:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:42:42] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:42:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:42:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:42:42] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:42:42] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:42:42] [INFO ] After 55ms 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-12 13:42:42] [INFO ] After 143ms 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 591 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 114 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-12 13:42:43] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-12 13:42:43] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 13:42:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:42:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 13:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:42:45] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2023-03-12 13:42:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:42:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 24 ms returned sat
[2023-03-12 13:42:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:42:46] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-12 13:42:46] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:46] [INFO ] [Nat]Added 274 Read/Feed constraints in 94 ms returned sat
[2023-03-12 13:42:47] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 101 ms.
[2023-03-12 13:42:47] [INFO ] Added : 10 causal constraints over 2 iterations in 298 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 131 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 506 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 90 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-12 13:42:48] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:48] [INFO ] Invariant cache hit.
[2023-03-12 13:42:48] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 13:42:48] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:48] [INFO ] Invariant cache hit.
[2023-03-12 13:42:49] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-12 13:42:50] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2023-03-12 13:42:50] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 13:42:50] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-12 13:42:50] [INFO ] Invariant cache hit.
[2023-03-12 13:42:50] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2631 ms. Remains : 641/641 places, 1670/1670 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-07 finished in 57231 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 320 ms. Remains 633 /740 variables (removed 107) and now considering 1648/1928 (removed 280) transitions.
[2023-03-12 13:42:51] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-12 13:42:51] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 13:42:51] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-12 13:42:51] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:42:51] [INFO ] Invariant cache hit.
[2023-03-12 13:42:51] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:42:53] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2023-03-12 13:42:53] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 13:42:53] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:42:53] [INFO ] Invariant cache hit.
[2023-03-12 13:42:53] [INFO ] Dead Transitions using invariants and state equation in 556 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 2633 ms. Remains : 633/740 places, 1648/1928 transitions.
Stuttering acceptance computed with spot in 83 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 499 ms.
Stack based approach found an accepted trace after 1796 steps with 0 reset with depth 1797 and stack size 1797 in 9 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 3250 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 124 ms. Remains 605 /740 variables (removed 135) and now considering 1586/1928 (removed 342) transitions.
[2023-03-12 13:42:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-12 13:42:54] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:42:54] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 13:42:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:42:54] [INFO ] Invariant cache hit.
[2023-03-12 13:42:55] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:42:56] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-12 13:42:56] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:42:56] [INFO ] Invariant cache hit.
[2023-03-12 13:42:56] [INFO ] Dead Transitions using invariants and state equation in 538 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 2510 ms. Remains : 605/740 places, 1586/1928 transitions.
Stuttering acceptance computed with spot in 92 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 390 ms.
Product exploration explored 100000 steps with 0 reset in 475 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 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 74 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
Finished Best-First random walk after 236 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=236 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 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 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 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 13 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-12 13:42:58] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:42:58] [INFO ] Invariant cache hit.
[2023-03-12 13:42:58] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 13:42:58] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:42:58] [INFO ] Invariant cache hit.
[2023-03-12 13:42:59] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:43:00] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2023-03-12 13:43:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:43:00] [INFO ] Invariant cache hit.
[2023-03-12 13:43:00] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2376 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 120 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 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499925 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499925 steps, saw 324483 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:43:04] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:43:04] [INFO ] Invariant cache hit.
[2023-03-12 13:43:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:43:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:04] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:43:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:43:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:43:04] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:43:04] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:43:05] [INFO ] After 294ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:43:05] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-12 13:43:05] [INFO ] After 971ms 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 80 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 81 ms. Remains : 416/605 places, 1205/1586 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 183 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 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 420 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 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 265 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2023-03-12 13:43:07] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 13:43:07] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 13:43:07] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:43:07] [INFO ] Dead Transitions using invariants and state equation in 501 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 807 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 11 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-12 13:43:07] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-12 13:43:07] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:43:08] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-12 13:43:08] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:43:08] [INFO ] Invariant cache hit.
[2023-03-12 13:43:08] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:43:09] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2023-03-12 13:43:09] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:43:09] [INFO ] Invariant cache hit.
[2023-03-12 13:43:10] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2366 ms. Remains : 605/605 places, 1586/1586 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-09 finished in 15970 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 162 ms. Remains 620 /740 variables (removed 120) and now considering 1624/1928 (removed 304) transitions.
[2023-03-12 13:43:10] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2023-03-12 13:43:10] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 13:43:10] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-12 13:43:10] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:10] [INFO ] Invariant cache hit.
[2023-03-12 13:43:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:12] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2023-03-12 13:43:12] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:12] [INFO ] Invariant cache hit.
[2023-03-12 13:43:12] [INFO ] Dead Transitions using invariants and state equation in 540 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 2683 ms. Remains : 620/740 places, 1624/1928 transitions.
Stuttering acceptance computed with spot in 169 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 433 ms.
Stack based approach found an accepted trace after 126 steps with 0 reset with depth 127 and stack size 127 in 2 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-10 finished in 3312 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 164 ms. Remains 623 /740 variables (removed 117) and now considering 1630/1928 (removed 298) transitions.
[2023-03-12 13:43:13] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:43:13] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 13:43:14] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 13:43:14] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:14] [INFO ] Invariant cache hit.
[2023-03-12 13:43:14] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:15] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-12 13:43:15] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:15] [INFO ] Invariant cache hit.
[2023-03-12 13:43:16] [INFO ] Dead Transitions using invariants and state equation in 502 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 2727 ms. Remains : 623/740 places, 1630/1928 transitions.
Stuttering acceptance computed with spot in 147 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 673 ms.
Product exploration explored 100000 steps with 25000 reset in 673 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 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 144 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 101 ms. (steps per millisecond=99 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 281479 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281479 steps, saw 182711 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:43:21] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:21] [INFO ] Invariant cache hit.
[2023-03-12 13:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:21] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:43:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:43:22] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:22] [INFO ] After 399ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:23] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-12 13:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-12 13:43:23] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-12 13:43:23] [INFO ] After 1952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 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 157 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 157 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 299450 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299450 steps, saw 194374 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:43:26] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:43:26] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 13:43:27] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:43:27] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:43:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:28] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:28] [INFO ] After 378ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:28] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-12 13:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-12 13:43:28] [INFO ] After 910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-12 13:43:29] [INFO ] After 1819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 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 68 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 68 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 76 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-12 13:43:29] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:29] [INFO ] Invariant cache hit.
[2023-03-12 13:43:29] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-12 13:43:29] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:29] [INFO ] Invariant cache hit.
[2023-03-12 13:43:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:30] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2023-03-12 13:43:31] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 13:43:31] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:31] [INFO ] Invariant cache hit.
[2023-03-12 13:43:31] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2221 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 28 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-12 13:43:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 13:43:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:43:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:31] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:43:31] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:31] [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-12 13:43:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:43:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:31] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:31] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:31] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 13:43:31] [INFO ] After 60ms 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 83 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 135 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 134 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 13 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-12 13:43:32] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:43:32] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-12 13:43:32] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-12 13:43:32] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:32] [INFO ] Invariant cache hit.
[2023-03-12 13:43:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:33] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2023-03-12 13:43:33] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:33] [INFO ] Invariant cache hit.
[2023-03-12 13:43:34] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2269 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 88 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 172 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 83 ms. (steps per millisecond=120 ) 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 308669 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308669 steps, saw 200357 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:43:37] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:37] [INFO ] Invariant cache hit.
[2023-03-12 13:43:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:38] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:43:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:38] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:39] [INFO ] After 382ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:39] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-12 13:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-12 13:43:39] [INFO ] After 906ms 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-12 13:43:40] [INFO ] After 1835ms 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 147 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 147 ms. Remains : 623/623 places, 1624/1630 transitions.
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 17 ms. (steps per millisecond=588 ) 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
Interrupted probabilistic random walk after 308997 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308997 steps, saw 200572 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:43:43] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:43:43] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:43:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:43:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:43] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:43:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:43:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:43:44] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:44] [INFO ] After 403ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:45] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-12 13:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-12 13:43:45] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-12 13:43:45] [INFO ] After 1903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 79 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 79 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-12 13:43:45] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:45] [INFO ] Invariant cache hit.
[2023-03-12 13:43:46] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 13:43:46] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:46] [INFO ] Invariant cache hit.
[2023-03-12 13:43:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:47] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2023-03-12 13:43:47] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-12 13:43:47] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:43:47] [INFO ] Invariant cache hit.
[2023-03-12 13:43:47] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2276 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 29 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-12 13:43:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 13:43:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:43:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:43:48] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:43:48] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:48] [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-12 13:43:48] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:43:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:43:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:43:48] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:48] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:43:48] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 13:43:48] [INFO ] After 63ms 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 178 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 160 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 142 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 599 ms.
Product exploration explored 100000 steps with 25000 reset in 604 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 147 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 162 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
[2023-03-12 13:43:50] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 13:43:50] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:43:50] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:43:50] [INFO ] Dead Transitions using invariants and state equation in 495 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 697 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-12 13:43:50] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:43:50] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:43:51] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-12 13:43:51] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:51] [INFO ] Invariant cache hit.
[2023-03-12 13:43:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:43:52] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2023-03-12 13:43:52] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:43:52] [INFO ] Invariant cache hit.
[2023-03-12 13:43:53] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2260 ms. Remains : 623/623 places, 1630/1630 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 39667 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 125 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 190 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-12 13:43:53] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:43:53] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:43:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 13:43:54] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:43:54] [INFO ] Invariant cache hit.
[2023-03-12 13:43:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:43:55] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2023-03-12 13:43:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:43:55] [INFO ] Invariant cache hit.
[2023-03-12 13:43:56] [INFO ] Dead Transitions using invariants and state equation in 512 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 2525 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 432 ms.
Product exploration explored 100000 steps with 0 reset in 456 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 546 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 95 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 10002 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) 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 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 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 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
Interrupted probabilistic random walk after 198882 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198882 steps, saw 129105 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:44:01] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:01] [INFO ] Invariant cache hit.
[2023-03-12 13:44:01] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:44:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:01] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:44:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:03] [INFO ] After 1452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:03] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:04] [INFO ] After 1365ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:04] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-12 13:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-12 13:44:05] [INFO ] After 2713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1072 ms.
[2023-03-12 13:44:06] [INFO ] After 5413ms 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 160 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 160 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 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 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 10000 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 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 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 192067 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192067 steps, saw 124682 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:44:10] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-12 13:44:10] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 13:44:10] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:44:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:11] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:44:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:12] [INFO ] After 1408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:13] [INFO ] After 1178ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:14] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2023-03-12 13:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-12 13:44:15] [INFO ] After 2437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 738 ms.
[2023-03-12 13:44:15] [INFO ] After 4771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 20 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 70 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 70 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-12 13:44:16] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:16] [INFO ] Invariant cache hit.
[2023-03-12 13:44:16] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-12 13:44:16] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:16] [INFO ] Invariant cache hit.
[2023-03-12 13:44:16] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:17] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2023-03-12 13:44:17] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 13:44:17] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:17] [INFO ] Invariant cache hit.
[2023-03-12 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2529 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 1 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-12 13:44:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 13:44:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:44:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:18] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:44:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:18] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:44:18] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:18] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 13:44:18] [INFO ] After 130ms 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 552 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 108 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 18 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-12 13:44:19] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:44:19] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:44:19] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-12 13:44:19] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:19] [INFO ] Invariant cache hit.
[2023-03-12 13:44:20] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:21] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2023-03-12 13:44:21] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:21] [INFO ] Invariant cache hit.
[2023-03-12 13:44:21] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2401 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 527 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 122 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 124 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 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
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
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
Interrupted probabilistic random walk after 208990 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208990 steps, saw 135665 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:44:25] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:25] [INFO ] Invariant cache hit.
[2023-03-12 13:44:25] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:44:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:26] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:44:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:28] [INFO ] After 1428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:29] [INFO ] After 1375ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:29] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-12 13:44:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-03-12 13:44:30] [INFO ] After 2725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1115 ms.
[2023-03-12 13:44:31] [INFO ] After 5455ms 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 156 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 157 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) 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 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 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 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 214784 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214784 steps, saw 139427 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:44:35] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-12 13:44:35] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 13:44:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:44:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:35] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:44:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:37] [INFO ] After 1385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:38] [INFO ] After 1184ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:38] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 0 ms to minimize.
[2023-03-12 13:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-12 13:44:39] [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 761 ms.
[2023-03-12 13:44:40] [INFO ] After 4833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
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, 1648/1648 transitions.
Applied a total of 0 rules in 75 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 72 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-12 13:44:40] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:40] [INFO ] Invariant cache hit.
[2023-03-12 13:44:41] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-12 13:44:41] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:41] [INFO ] Invariant cache hit.
[2023-03-12 13:44:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:42] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2023-03-12 13:44:42] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 13:44:42] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-12 13:44:42] [INFO ] Invariant cache hit.
[2023-03-12 13:44:43] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2566 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 33 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-12 13:44:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:44:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:44:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:43] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:44:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:44:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:43] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:44:43] [INFO ] After 29ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:44:43] [INFO ] After 57ms 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-12 13:44:43] [INFO ] After 136ms 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 611 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 126 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 134 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 426 ms.
Product exploration explored 100000 steps with 0 reset in 479 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 12 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-12 13:44:45] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-12 13:44:45] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:44:45] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-12 13:44:45] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:45] [INFO ] Invariant cache hit.
[2023-03-12 13:44:46] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-12 13:44:47] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
[2023-03-12 13:44:47] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-12 13:44:47] [INFO ] Invariant cache hit.
[2023-03-12 13:44:48] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2576 ms. Remains : 633/633 places, 1656/1656 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 54760 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 88 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 177 ms. Remains 605 /740 variables (removed 135) and now considering 1586/1928 (removed 342) transitions.
[2023-03-12 13:44:48] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-12 13:44:48] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:44:48] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-12 13:44:48] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:48] [INFO ] Invariant cache hit.
[2023-03-12 13:44:49] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:44:50] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-12 13:44:50] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:50] [INFO ] Invariant cache hit.
[2023-03-12 13:44:51] [INFO ] Dead Transitions using invariants and state equation in 509 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 2870 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 398 ms.
Product exploration explored 100000 steps with 0 reset in 433 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 147 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 87 ms :[true, (NOT p0), (NOT p0)]
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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 517621 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 517621 steps, saw 335969 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:44:55] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:55] [INFO ] Invariant cache hit.
[2023-03-12 13:44:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:44:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:44:55] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:44:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 13:44:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:44:56] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:44:56] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:44:56] [INFO ] After 298ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:44:56] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-12 13:44:56] [INFO ] After 981ms 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 85 ms. Remains : 416/605 places, 1205/1586 transitions.
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 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 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 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-12 13:44:57] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:57] [INFO ] Invariant cache hit.
[2023-03-12 13:44:57] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-12 13:44:57] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:57] [INFO ] Invariant cache hit.
[2023-03-12 13:44:57] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:44:59] [INFO ] Implicit Places using invariants and state equation in 1800 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2023-03-12 13:44:59] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:44:59] [INFO ] Invariant cache hit.
[2023-03-12 13:44:59] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2637 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 133 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 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 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 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 520737 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520737 steps, saw 337992 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:45:03] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:45:03] [INFO ] Invariant cache hit.
[2023-03-12 13:45:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:03] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:45:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:45:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:45:04] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:04] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:45:04] [INFO ] After 297ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:04] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-12 13:45:04] [INFO ] After 993ms 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 89 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 89 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614146 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614146 steps, saw 376582 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:45:07] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2023-03-12 13:45:07] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:45:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:08] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:45:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:08] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:45:08] [INFO ] After 104ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:08] [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 119 ms.
[2023-03-12 13:45:08] [INFO ] After 649ms 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 43 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 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-12 13:45:08] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-12 13:45:08] [INFO ] Invariant cache hit.
[2023-03-12 13:45:09] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-12 13:45:09] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-12 13:45:09] [INFO ] Invariant cache hit.
[2023-03-12 13:45:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:45:09] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2023-03-12 13:45:10] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 13:45:10] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-12 13:45:10] [INFO ] Invariant cache hit.
[2023-03-12 13:45:10] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1507 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 30 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-12 13:45:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 13:45:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:45:10] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:45:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:45:10] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:45:10] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:45:10] [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 2 ms.
[2023-03-12 13:45:10] [INFO ] After 34ms 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 137 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 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 475 ms.
Applying partial POR strategy [true, false, true]
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 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 152 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2023-03-12 13:45:12] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 13:45:12] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 13:45:12] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 13:45:12] [INFO ] Dead Transitions using invariants and state equation in 503 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 693 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 11 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-12 13:45:12] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-12 13:45:12] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:45:12] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 13:45:12] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:45:12] [INFO ] Invariant cache hit.
[2023-03-12 13:45:13] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 13:45:14] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2023-03-12 13:45:14] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-12 13:45:14] [INFO ] Invariant cache hit.
[2023-03-12 13:45:15] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2693 ms. Remains : 605/605 places, 1586/1586 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-09 finished in 27047 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))))))))'
Found a Shortening insensitive property : FunctionPointer-PT-c004-LTLFireability-13
Stuttering acceptance computed with spot in 151 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-12 13:45:15] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:45:15] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:45:16] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-12 13:45:16] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:16] [INFO ] Invariant cache hit.
[2023-03-12 13:45:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:17] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-12 13:45:17] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:17] [INFO ] Invariant cache hit.
[2023-03-12 13:45:18] [INFO ] Dead Transitions using invariants and state equation in 498 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 2442 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 617 ms.
Product exploration explored 100000 steps with 25000 reset in 631 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 171 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 159 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 96 ms. (steps per millisecond=104 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 247880 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247880 steps, saw 160906 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:45:22] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:22] [INFO ] Invariant cache hit.
[2023-03-12 13:45:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:45:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:45:23] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:45:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:23] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:24] [INFO ] After 389ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:24] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
[2023-03-12 13:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-12 13:45:24] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 345 ms.
[2023-03-12 13:45:25] [INFO ] After 1896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 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 145 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 145 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 301186 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301186 steps, saw 195500 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:45:28] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:45:28] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 13:45:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:45:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:45:28] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:45:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 13:45:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:45:29] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:29] [INFO ] After 395ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:30] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2023-03-12 13:45:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-12 13:45:30] [INFO ] After 941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-12 13:45:30] [INFO ] After 1897ms 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 71 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 83 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-12 13:45:30] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:30] [INFO ] Invariant cache hit.
[2023-03-12 13:45:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 13:45:31] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:31] [INFO ] Invariant cache hit.
[2023-03-12 13:45:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:32] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2023-03-12 13:45:32] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 13:45:32] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:32] [INFO ] Invariant cache hit.
[2023-03-12 13:45:33] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2294 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 30 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-12 13:45:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 13:45:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:45:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:33] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:45:33] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:33] [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 3 ms.
[2023-03-12 13:45:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:45:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:33] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:33] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:33] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 13:45:33] [INFO ] After 56ms 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 84 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 139 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 148 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 14 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2023-03-12 13:45:33] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:45:33] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:45:34] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-12 13:45:34] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:34] [INFO ] Invariant cache hit.
[2023-03-12 13:45:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:35] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-12 13:45:35] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:35] [INFO ] Invariant cache hit.
[2023-03-12 13:45:36] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2538 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 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 144 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 110 ms. (steps per millisecond=90 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 330262 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330262 steps, saw 214371 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:45:39] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:39] [INFO ] Invariant cache hit.
[2023-03-12 13:45:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:40] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:45:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-12 13:45:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:45:40] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:41] [INFO ] After 374ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:41] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 1 ms to minimize.
[2023-03-12 13:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-12 13:45:41] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-12 13:45:41] [INFO ] After 1865ms 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 139 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) 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 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 325065 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325065 steps, saw 210999 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:45:45] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:45:45] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 13:45:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:45] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:45:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:45:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:46] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:46] [INFO ] After 384ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:46] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2023-03-12 13:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-12 13:45:47] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-12 13:45:47] [INFO ] After 1879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 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-12 13:45:47] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:47] [INFO ] Invariant cache hit.
[2023-03-12 13:45:47] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-12 13:45:47] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:47] [INFO ] Invariant cache hit.
[2023-03-12 13:45:48] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:49] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2023-03-12 13:45:49] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-12 13:45:49] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-12 13:45:49] [INFO ] Invariant cache hit.
[2023-03-12 13:45:49] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2281 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 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-12 13:45:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 13:45:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:45:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:49] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:45:49] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:49] [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-12 13:45:49] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-12 13:45:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:45:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:45:50] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:50] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:45:50] [INFO ] After 14ms 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-12 13:45:50] [INFO ] After 53ms 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 73 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 139 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 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 638 ms.
Product exploration explored 100000 steps with 25000 reset in 642 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 153 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 162 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
[2023-03-12 13:45:52] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-12 13:45:52] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-12 13:45:52] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 13:45:52] [INFO ] Dead Transitions using invariants and state equation in 512 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 717 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-12 13:45:52] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-12 13:45:52] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:45:53] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 13:45:53] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:53] [INFO ] Invariant cache hit.
[2023-03-12 13:45:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 13:45:54] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
[2023-03-12 13:45:54] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-12 13:45:54] [INFO ] Invariant cache hit.
[2023-03-12 13:45:55] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2350 ms. Remains : 623/623 places, 1630/1630 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 39863 ms.
[2023-03-12 13:45:55] [INFO ] Flatten gal took : 69 ms
[2023-03-12 13:45:55] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 13:45:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 740 places, 1928 transitions and 7838 arcs took 13 ms.
Total runtime 393721 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3065/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3065/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3065/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3065/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3065/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-c004-LTLFireability-00
Could not compute solution for formula : FunctionPointer-PT-c004-LTLFireability-04
Could not compute solution for formula : FunctionPointer-PT-c004-LTLFireability-07
Could not compute solution for formula : FunctionPointer-PT-c004-LTLFireability-09
Could not compute solution for formula : FunctionPointer-PT-c004-LTLFireability-13

BK_STOP 1678628759595

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-c004-LTLFireability-00
ltl formula formula --ltl=/tmp/3065/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 740 places, 1928 transitions and 7838 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.040 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3065/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3065/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3065/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3065/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-c004-LTLFireability-04
ltl formula formula --ltl=/tmp/3065/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 740 places, 1928 transitions and 7838 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.070 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3065/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3065/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3065/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3065/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FunctionPointer-PT-c004-LTLFireability-07
ltl formula formula --ltl=/tmp/3065/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 740 places, 1928 transitions and 7838 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3065/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3065/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3065/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.060 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3065/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-c004-LTLFireability-09
ltl formula formula --ltl=/tmp/3065/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 740 places, 1928 transitions and 7838 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3065/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3065/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3065/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3065/ltl_3_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FunctionPointer-PT-c004-LTLFireability-13
ltl formula formula --ltl=/tmp/3065/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 740 places, 1928 transitions and 7838 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.090 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3065/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3065/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3065/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3065/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-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 r169-tall-167838856300724"
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 ;