About the Execution of ITS-Tools for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.792 | 3600000.00 | 10397462.00 | 42304.90 | ?TFF?FFFFFFTFTFF | 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.r165-tall-167838850800724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-c004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800724
=====================================================================
--------------------
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 1679568096980
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 10:41:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 10:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 10:41:38] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2023-03-23 10:41:38] [INFO ] Transformed 2826 places.
[2023-03-23 10:41:38] [INFO ] Transformed 8960 transitions.
[2023-03-23 10:41:38] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 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 1232 ms. Remains 740 /1628 variables (removed 888) and now considering 1928/5962 (removed 4034) transitions.
[2023-03-23 10:41:41] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
// Phase 1: matrix 1291 rows 740 cols
[2023-03-23 10:41:41] [INFO ] Computed 2 place invariants in 34 ms
[2023-03-23 10:41:41] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-23 10:41:41] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-23 10:41:41] [INFO ] Invariant cache hit.
[2023-03-23 10:41:42] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-23 10:41:44] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
[2023-03-23 10:41:44] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-23 10:41:44] [INFO ] Invariant cache hit.
[2023-03-23 10:41:44] [INFO ] Dead Transitions using invariants and state equation in 627 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 4646 ms. Remains : 740/1628 places, 1928/5962 transitions.
Support contains 22 out of 740 places after structural reductions.
[2023-03-23 10:41:45] [INFO ] Flatten gal took : 178 ms
[2023-03-23 10:41:45] [INFO ] Flatten gal took : 90 ms
[2023-03-23 10:41:45] [INFO ] Input system was already deterministic with 1928 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 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 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-23 10:41:46] [INFO ] Flow matrix only has 1291 transitions (discarded 637 similar events)
[2023-03-23 10:41:46] [INFO ] Invariant cache hit.
[2023-03-23 10:41:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:41:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:41:47] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2023-03-23 10:41:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:41:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:41:50] [INFO ] After 2246ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-23 10:41:50] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-23 10:41:51] [INFO ] After 1759ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-03-23 10:41:52] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 5 ms to minimize.
[2023-03-23 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-23 10:41:52] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 1 ms to minimize.
[2023-03-23 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-23 10:41:54] [INFO ] After 4150ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 1399 ms.
[2023-03-23 10:41:55] [INFO ] After 8274ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 17 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1928/1928 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 739 transition count 1926
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 739 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 738 transition count 1924
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 738 transition count 1924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 737 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 737 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 736 transition count 1916
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 736 transition count 1916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 735 transition count 1914
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 735 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 734 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 734 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 733 transition count 1910
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 733 transition count 1910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 732 transition count 1908
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 732 transition count 1908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 731 transition count 1906
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 731 transition count 1906
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 48 place count 731 transition count 1876
Applied a total of 48 rules in 526 ms. Remains 731 /740 variables (removed 9) and now considering 1876/1928 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 731/740 places, 1876/1928 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 172391 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172391 steps, saw 111913 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-23 10:41:59] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
// Phase 1: matrix 1261 rows 731 cols
[2023-03-23 10:41:59] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 10:41:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:41:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:42:00] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 10:42:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:02] [INFO ] After 2093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-23 10:42:02] [INFO ] State equation strengthened by 306 read => feed constraints.
[2023-03-23 10:42:04] [INFO ] After 1846ms SMT Verify possible using 306 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-23 10:42:05] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 1 ms to minimize.
[2023-03-23 10:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-23 10:42:06] [INFO ] After 3684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1345 ms.
[2023-03-23 10:42:07] [INFO ] After 7513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 31 ms.
Support contains 17 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1876/1876 transitions.
Applied a total of 0 rules in 185 ms. Remains 731 /731 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 731/731 places, 1876/1876 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1876/1876 transitions.
Applied a total of 0 rules in 143 ms. Remains 731 /731 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
[2023-03-23 10:42:08] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
[2023-03-23 10:42:08] [INFO ] Invariant cache hit.
[2023-03-23 10:42:08] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-23 10:42:08] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
[2023-03-23 10:42:08] [INFO ] Invariant cache hit.
[2023-03-23 10:42:08] [INFO ] State equation strengthened by 306 read => feed constraints.
[2023-03-23 10:42:10] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2023-03-23 10:42:10] [INFO ] Redundant transitions in 110 ms returned []
[2023-03-23 10:42:10] [INFO ] Flow matrix only has 1261 transitions (discarded 615 similar events)
[2023-03-23 10:42:10] [INFO ] Invariant cache hit.
[2023-03-23 10:42:11] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3101 ms. Remains : 731/731 places, 1876/1876 transitions.
Graph (trivial) has 1104 edges and 731 vertex of which 192 / 731 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 487 transitions
Reduce isomorphic transitions removed 807 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 603 transition count 1052
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 586 transition count 1052
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 35 place count 586 transition count 938
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 263 place count 472 transition count 938
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 326 place count 409 transition count 875
Iterating global reduction 2 with 63 rules applied. Total rules applied 389 place count 409 transition count 875
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 515 place count 409 transition count 749
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 781 place count 276 transition count 616
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 845 place count 212 transition count 488
Iterating global reduction 3 with 64 rules applied. Total rules applied 909 place count 212 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 911 place count 212 transition count 486
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 974 place count 149 transition count 360
Iterating global reduction 4 with 63 rules applied. Total rules applied 1037 place count 149 transition count 360
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1100 place count 86 transition count 234
Iterating global reduction 4 with 63 rules applied. Total rules applied 1163 place count 86 transition count 234
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1226 place count 86 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1226 place count 86 transition count 170
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 1228 place count 85 transition count 170
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 1230 place count 84 transition count 169
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1254 place count 72 transition count 169
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 1267 place count 72 transition count 156
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1268 place count 72 transition count 156
Applied a total of 1268 rules in 96 ms. Remains 72 /731 variables (removed 659) and now considering 156/1876 (removed 1720) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 156 rows 72 cols
[2023-03-23 10:42:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 10:42:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:42:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:42:11] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2023-03-23 10:42:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:42:11] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 10:42:11] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-23 10:42:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:42:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:11] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-23 10:42:11] [INFO ] After 109ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-23 10:42:11] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-23 10:42:12] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
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 826 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-23 10:42:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 10:42:13] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 10:42:13] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-23 10:42:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:13] [INFO ] Invariant cache hit.
[2023-03-23 10:42:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:42:14] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-03-23 10:42:14] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 10:42:14] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:14] [INFO ] Invariant cache hit.
[2023-03-23 10:42:15] [INFO ] Dead Transitions using invariants and state equation in 535 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 3236 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 191 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 512 ms.
Product exploration explored 100000 steps with 0 reset in 476 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 120 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 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486655 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486655 steps, saw 315872 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:42:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:19] [INFO ] Invariant cache hit.
[2023-03-23 10:42:19] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:42:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:20] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:20] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:20] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:42:20] [INFO ] After 206ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:21] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-23 10:42:21] [INFO ] After 858ms 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.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 49 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 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 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 574409 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574409 steps, saw 352217 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:42:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2023-03-23 10:42:24] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-23 10:42:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:24] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 10:42:24] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:42:25] [INFO ] After 116ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:25] [INFO ] After 227ms 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-23 10:42:25] [INFO ] After 674ms 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 43 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 43 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 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2023-03-23 10:42:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:25] [INFO ] Invariant cache hit.
[2023-03-23 10:42:25] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-23 10:42:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:25] [INFO ] Invariant cache hit.
[2023-03-23 10:42:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:42:26] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
[2023-03-23 10:42:26] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-23 10:42:26] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:26] [INFO ] Invariant cache hit.
[2023-03-23 10:42:26] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1553 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 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 43 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-23 10:42:26] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 10:42:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 10:42:26] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 10:42:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:42:26] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:26] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 10:42:27] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:27] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:27] [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-23 10:42:27] [INFO ] After 36ms 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 143 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 89 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 82 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 10:42:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 10:42:27] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 10:42:27] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-23 10:42:27] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:27] [INFO ] Invariant cache hit.
[2023-03-23 10:42:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:42:29] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
[2023-03-23 10:42:29] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-23 10:42:29] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:29] [INFO ] Invariant cache hit.
[2023-03-23 10:42:29] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2406 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 108 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 74 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 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 499574 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 499574 steps, saw 324256 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:42:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:32] [INFO ] Invariant cache hit.
[2023-03-23 10:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:33] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:42:33] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:42:34] [INFO ] After 202ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:34] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-23 10:42:34] [INFO ] After 831ms 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.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 43 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 44 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596077 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596077 steps, saw 365504 distinct states, run finished after 3003 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:42:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2023-03-23 10:42:37] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-23 10:42:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:37] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 10:42:37] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:42:38] [INFO ] After 114ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:38] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-23 10:42:38] [INFO ] After 639ms 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 40 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 40 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 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2023-03-23 10:42:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:38] [INFO ] Invariant cache hit.
[2023-03-23 10:42:38] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-23 10:42:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:38] [INFO ] Invariant cache hit.
[2023-03-23 10:42:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:42:39] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-23 10:42:39] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 10:42:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2023-03-23 10:42:39] [INFO ] Invariant cache hit.
[2023-03-23 10:42:39] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1601 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 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 25 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2023-03-23 10:42:39] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 10:42:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 10:42:40] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 10:42:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:42:40] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:40] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:42:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 10:42:40] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:42:40] [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-23 10:42:40] [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 125 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 417 ms.
Product exploration explored 100000 steps with 0 reset in 427 ms.
Built C files in :
/tmp/ltsmin17309492261000865757
[2023-03-23 10:42:41] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2023-03-23 10:42:41] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17309492261000865757
Running compilation step : cd /tmp/ltsmin17309492261000865757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17309492261000865757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17309492261000865757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 83 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2023-03-23 10:42:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-23 10:42:44] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 10:42:44] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-23 10:42:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:44] [INFO ] Invariant cache hit.
[2023-03-23 10:42:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:42:46] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2023-03-23 10:42:46] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 10:42:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:42:46] [INFO ] Invariant cache hit.
[2023-03-23 10:42:46] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2331 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin18442691854155895666
[2023-03-23 10:42:46] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2023-03-23 10:42:46] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18442691854155895666
Running compilation step : cd /tmp/ltsmin18442691854155895666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2619 ms.
Running link step : cd /tmp/ltsmin18442691854155895666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin18442691854155895666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7023400220592901680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 10:43:02] [INFO ] Flatten gal took : 56 ms
[2023-03-23 10:43:02] [INFO ] Flatten gal took : 55 ms
[2023-03-23 10:43:02] [INFO ] Time to serialize gal into /tmp/LTL15675198781742743559.gal : 10 ms
[2023-03-23 10:43:02] [INFO ] Time to serialize properties into /tmp/LTL13970717797871346468.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15675198781742743559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3135134090826957171.hoa' '-atoms' '/tmp/LTL13970717797871346468.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13970717797871346468.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3135134090826957171.hoa
Detected timeout of ITS tools.
[2023-03-23 10:43:17] [INFO ] Flatten gal took : 52 ms
[2023-03-23 10:43:17] [INFO ] Flatten gal took : 49 ms
[2023-03-23 10:43:17] [INFO ] Time to serialize gal into /tmp/LTL152927688284539258.gal : 8 ms
[2023-03-23 10:43:17] [INFO ] Time to serialize properties into /tmp/LTL10432590364631339777.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL152927688284539258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10432590364631339777.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1638<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1638<1))"
Detected timeout of ITS tools.
[2023-03-23 10:43:32] [INFO ] Flatten gal took : 49 ms
[2023-03-23 10:43:32] [INFO ] Applying decomposition
[2023-03-23 10:43:32] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6841253496278486392.txt' '-o' '/tmp/graph6841253496278486392.bin' '-w' '/tmp/graph6841253496278486392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6841253496278486392.bin' '-l' '-1' '-v' '-w' '/tmp/graph6841253496278486392.weights' '-q' '0' '-e' '0.001'
[2023-03-23 10:43:32] [INFO ] Decomposing Gal with order
[2023-03-23 10:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 10:43:32] [INFO ] Removed a total of 2657 redundant transitions.
[2023-03-23 10:43:32] [INFO ] Flatten gal took : 150 ms
[2023-03-23 10:43:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1181 labels/synchronizations in 82 ms.
[2023-03-23 10:43:33] [INFO ] Time to serialize gal into /tmp/LTL8243849544064677822.gal : 13 ms
[2023-03-23 10:43:33] [INFO ] Time to serialize properties into /tmp/LTL7065070086171751488.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8243849544064677822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7065070086171751488.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i17.i0.u1.s1<1)||(i25.i2.u151.l1638<1))"))))
Formula 0 simplified : FG!"((i17.i0.u1.s1<1)||(i25.i2.u151.l1638<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2457923988300463255
[2023-03-23 10:43:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2457923988300463255
Running compilation step : cd /tmp/ltsmin2457923988300463255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2710 ms.
Running link step : cd /tmp/ltsmin2457923988300463255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2457923988300463255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-00 finished in 111055 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 303 ms. Remains 614 /740 variables (removed 126) and now considering 1604/1928 (removed 324) transitions.
[2023-03-23 10:44:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:44:03] [INFO ] Invariant cache hit.
[2023-03-23 10:44:03] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-23 10:44:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:44:03] [INFO ] Invariant cache hit.
[2023-03-23 10:44:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-23 10:44:05] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2023-03-23 10:44:05] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-23 10:44:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-23 10:44:05] [INFO ] Invariant cache hit.
[2023-03-23 10:44:05] [INFO ] Dead Transitions using invariants and state equation in 506 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 2789 ms. Remains : 614/740 places, 1604/1928 transitions.
Stuttering acceptance computed with spot in 105 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 413 ms.
Stack based approach found an accepted trace after 999 steps with 0 reset with depth 1000 and stack size 1000 in 5 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-03 finished in 3335 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 139 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-23 10:44:06] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:44:06] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 10:44:07] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-23 10:44:07] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:07] [INFO ] Invariant cache hit.
[2023-03-23 10:44:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:08] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2023-03-23 10:44:08] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:08] [INFO ] Invariant cache hit.
[2023-03-23 10:44:09] [INFO ] Dead Transitions using invariants and state equation in 537 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 2808 ms. Remains : 633/740 places, 1656/1928 transitions.
Stuttering acceptance computed with spot in 128 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 494 ms.
Product exploration explored 100000 steps with 0 reset in 573 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 478 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 162 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 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 227668 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227668 steps, saw 147788 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:44:14] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:14] [INFO ] Invariant cache hit.
[2023-03-23 10:44:14] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:44:15] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-23 10:44:16] [INFO ] After 1370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:16] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:18] [INFO ] After 1307ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:18] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 0 ms to minimize.
[2023-03-23 10:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-23 10:44:19] [INFO ] After 2597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1049 ms.
[2023-03-23 10:44:20] [INFO ] After 5204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 139 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 139 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 209883 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209883 steps, saw 136245 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:44:23] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-23 10:44:23] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 10:44:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:44:24] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:26] [INFO ] After 1322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:27] [INFO ] After 1114ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:27] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-23 10:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-23 10:44:28] [INFO ] After 2375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 717 ms.
[2023-03-23 10:44:29] [INFO ] After 4593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 14 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 68 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 68 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 79 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-23 10:44:29] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:29] [INFO ] Invariant cache hit.
[2023-03-23 10:44:29] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-23 10:44:29] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:29] [INFO ] Invariant cache hit.
[2023-03-23 10:44:29] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:31] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-03-23 10:44:31] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 10:44:31] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:31] [INFO ] Invariant cache hit.
[2023-03-23 10:44:31] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2586 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 1 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 1 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 28 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-23 10:44:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 10:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:44:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:44:31] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:44:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:31] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:44:31] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:31] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-23 10:44:31] [INFO ] After 125ms 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 475 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 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))]
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 15 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-23 10:44:32] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:44:32] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 10:44:33] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-23 10:44:33] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:33] [INFO ] Invariant cache hit.
[2023-03-23 10:44:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:34] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2023-03-23 10:44:34] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:34] [INFO ] Invariant cache hit.
[2023-03-23 10:44:35] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2531 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 555 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 108 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 10003 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 23 ms. (steps per millisecond=434 ) 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 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 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 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 189520 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189520 steps, saw 123029 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:44:39] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:44:39] [INFO ] Invariant cache hit.
[2023-03-23 10:44:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:39] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:44:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:44:41] [INFO ] After 1335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:42] [INFO ] After 1263ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:42] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2023-03-23 10:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-23 10:44:43] [INFO ] After 2524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1039 ms.
[2023-03-23 10:44:44] [INFO ] After 5086ms 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 14 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 157 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 10003 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) 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 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 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 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 196098 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196098 steps, saw 127299 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:44:48] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-23 10:44:48] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 10:44:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:44:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:48] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:44:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:50] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:51] [INFO ] After 1125ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:51] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-23 10:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-23 10:44:52] [INFO ] After 2377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 726 ms.
[2023-03-23 10:44:53] [INFO ] After 4623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 31 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 79 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 79 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 77 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-23 10:44:53] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:53] [INFO ] Invariant cache hit.
[2023-03-23 10:44:54] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-23 10:44:54] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:54] [INFO ] Invariant cache hit.
[2023-03-23 10:44:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:44:55] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2023-03-23 10:44:55] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 10:44:55] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:44:55] [INFO ] Invariant cache hit.
[2023-03-23 10:44:56] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2604 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 1 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-23 10:44:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 10:44:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:44:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:44:56] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:44:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:44:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:44:56] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:44:56] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:44:56] [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-23 10:44:56] [INFO ] After 129ms 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 598 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 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 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 142 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 443 ms.
Product exploration explored 100000 steps with 0 reset in 473 ms.
Built C files in :
/tmp/ltsmin9867246507321583783
[2023-03-23 10:44:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9867246507321583783
Running compilation step : cd /tmp/ltsmin9867246507321583783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9867246507321583783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9867246507321583783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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-23 10:45:01] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:45:01] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-23 10:45:02] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-23 10:45:02] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:45:02] [INFO ] Invariant cache hit.
[2023-03-23 10:45:02] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:45:03] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2023-03-23 10:45:03] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:45:03] [INFO ] Invariant cache hit.
[2023-03-23 10:45:04] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2530 ms. Remains : 633/633 places, 1656/1656 transitions.
Built C files in :
/tmp/ltsmin16406077485366780238
[2023-03-23 10:45:04] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16406077485366780238
Running compilation step : cd /tmp/ltsmin16406077485366780238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2936 ms.
Running link step : cd /tmp/ltsmin16406077485366780238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16406077485366780238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3416868601408767740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 10:45:19] [INFO ] Flatten gal took : 40 ms
[2023-03-23 10:45:19] [INFO ] Flatten gal took : 39 ms
[2023-03-23 10:45:19] [INFO ] Time to serialize gal into /tmp/LTL7887605193018226329.gal : 6 ms
[2023-03-23 10:45:19] [INFO ] Time to serialize properties into /tmp/LTL17349267240628226667.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7887605193018226329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5403567384604828998.hoa' '-atoms' '/tmp/LTL17349267240628226667.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17349267240628226667.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5403567384604828998.hoa
Detected timeout of ITS tools.
[2023-03-23 10:45:34] [INFO ] Flatten gal took : 36 ms
[2023-03-23 10:45:34] [INFO ] Flatten gal took : 35 ms
[2023-03-23 10:45:34] [INFO ] Time to serialize gal into /tmp/LTL7626100079915772812.gal : 6 ms
[2023-03-23 10:45:34] [INFO ] Time to serialize properties into /tmp/LTL960467630584525802.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7626100079915772812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL960467630584525802.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2144<1))")||((X(("((s0>=1)&&(l2076>=1))")||(G("((s0>=1)&&(l1636>=1))"))))||(F("((s0>=1)&&(l1636>=1))")))))))
Formula 0 simplified : G(F(!"((s0<1)||(l2144<1))" & X(!"((s0>=1)&&(l2076>=1))" & F!"((s0>=1)&&(l1636>=1))")) & FG!"((s0>=1)&&(l1636>=1))")
Detected timeout of ITS tools.
[2023-03-23 10:45:49] [INFO ] Flatten gal took : 37 ms
[2023-03-23 10:45:49] [INFO ] Applying decomposition
[2023-03-23 10:45:49] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12144841702960769515.txt' '-o' '/tmp/graph12144841702960769515.bin' '-w' '/tmp/graph12144841702960769515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12144841702960769515.bin' '-l' '-1' '-v' '-w' '/tmp/graph12144841702960769515.weights' '-q' '0' '-e' '0.001'
[2023-03-23 10:45:49] [INFO ] Decomposing Gal with order
[2023-03-23 10:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 10:45:49] [INFO ] Removed a total of 2763 redundant transitions.
[2023-03-23 10:45:49] [INFO ] Flatten gal took : 70 ms
[2023-03-23 10:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1333 labels/synchronizations in 44 ms.
[2023-03-23 10:45:50] [INFO ] Time to serialize gal into /tmp/LTL4343958425557197373.gal : 10 ms
[2023-03-23 10:45:50] [INFO ] Time to serialize properties into /tmp/LTL7270755932602251127.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4343958425557197373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7270755932602251127.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i25.i2.u155.l2144<1))")||((X(("((i0.u0.s0>=1)&&(i25.i2.u154.l2076>=1))")||(G("((i0.u0.s0>=1)&&(i25.i1.u151.l1...221
Formula 0 simplified : G(F(!"((i0.u0.s0<1)||(i25.i2.u155.l2144<1))" & X(!"((i0.u0.s0>=1)&&(i25.i2.u154.l2076>=1))" & F!"((i0.u0.s0>=1)&&(i25.i1.u151.l1636>...210
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14767818316843762074
[2023-03-23 10:46:05] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14767818316843762074
Running compilation step : cd /tmp/ltsmin14767818316843762074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2860 ms.
Running link step : cd /tmp/ltsmin14767818316843762074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14767818316843762074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp1==true)||[]((LTLAPp2==true))))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 133635 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 136 ms. Remains 606 /740 variables (removed 134) and now considering 1588/1928 (removed 340) transitions.
[2023-03-23 10:46:20] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2023-03-23 10:46:20] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 10:46:20] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-23 10:46:20] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-23 10:46:20] [INFO ] Invariant cache hit.
[2023-03-23 10:46:21] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-23 10:46:22] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2023-03-23 10:46:22] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2023-03-23 10:46:22] [INFO ] Invariant cache hit.
[2023-03-23 10:46:22] [INFO ] Dead Transitions using invariants and state equation in 502 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 2586 ms. Remains : 606/740 places, 1588/1928 transitions.
Stuttering acceptance computed with spot in 88 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 2710 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 313 ms. Remains 641 /740 variables (removed 99) and now considering 1670/1928 (removed 258) transitions.
[2023-03-23 10:46:23] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-23 10:46:23] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-23 10:46:23] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-23 10:46:23] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:23] [INFO ] Invariant cache hit.
[2023-03-23 10:46:23] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:25] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2023-03-23 10:46:25] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-23 10:46:25] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:25] [INFO ] Invariant cache hit.
[2023-03-23 10:46:25] [INFO ] Dead Transitions using invariants and state equation in 492 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 2739 ms. Remains : 641/740 places, 1670/1928 transitions.
Stuttering acceptance computed with spot in 130 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 425 ms.
Product exploration explored 100000 steps with 0 reset in 524 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 439 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 104 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 10:46:27] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:27] [INFO ] Invariant cache hit.
[2023-03-23 10:46:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:46:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:46:27] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:46:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:46:28] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:28] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:29] [INFO ] After 723ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:29] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 1 ms to minimize.
[2023-03-23 10:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-23 10:46:30] [INFO ] After 1641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-23 10:46:31] [INFO ] After 3054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 77 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 207607 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207607 steps, saw 134768 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 10:46:34] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:34] [INFO ] Invariant cache hit.
[2023-03-23 10:46:34] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:46:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:34] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:46:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:35] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:35] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:36] [INFO ] After 725ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:36] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-23 10:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-23 10:46:37] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-23 10:46:37] [INFO ] After 3034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 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 70 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 79 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-23 10:46:37] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:37] [INFO ] Invariant cache hit.
[2023-03-23 10:46:38] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-23 10:46:38] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:38] [INFO ] Invariant cache hit.
[2023-03-23 10:46:38] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:39] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-23 10:46:39] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-23 10:46:39] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:39] [INFO ] Invariant cache hit.
[2023-03-23 10:46:40] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2439 ms. Remains : 641/641 places, 1670/1670 transitions.
Graph (trivial) has 988 edges and 641 vertex of which 192 / 641 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 746 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 513 transition count 915
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 504 transition count 915
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 19 place count 504 transition count 831
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 187 place count 420 transition count 831
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 250 place count 357 transition count 768
Iterating global reduction 2 with 63 rules applied. Total rules applied 313 place count 357 transition count 768
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 439 place count 357 transition count 642
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 701 place count 226 transition count 511
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 765 place count 162 transition count 383
Iterating global reduction 3 with 64 rules applied. Total rules applied 829 place count 162 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 162 transition count 382
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 893 place count 99 transition count 256
Iterating global reduction 4 with 63 rules applied. Total rules applied 956 place count 99 transition count 256
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1019 place count 36 transition count 130
Iterating global reduction 4 with 63 rules applied. Total rules applied 1082 place count 36 transition count 130
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1145 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1145 place count 36 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1147 place count 35 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1149 place count 34 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1157 place count 30 transition count 65
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 30 transition count 58
Applied a total of 1164 rules in 32 ms. Remains 30 /641 variables (removed 611) and now considering 58/1670 (removed 1612) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 58 rows 30 cols
[2023-03-23 10:46:40] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 10:46:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:46:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:46:40] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:46:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:46:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:40] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:46:40] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:40] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-23 10:46:40] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 657 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 125 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-23 10:46:41] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-23 10:46:41] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 10:46:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 10:46:43] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2023-03-23 10:46:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 10:46:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-23 10:46:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 10:46:44] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-23 10:46:44] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:44] [INFO ] [Nat]Added 274 Read/Feed constraints in 87 ms returned sat
[2023-03-23 10:46:44] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 193 ms.
[2023-03-23 10:46:45] [INFO ] Added : 10 causal constraints over 2 iterations in 415 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 87 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-23 10:46:45] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:45] [INFO ] Invariant cache hit.
[2023-03-23 10:46:45] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-23 10:46:45] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:45] [INFO ] Invariant cache hit.
[2023-03-23 10:46:45] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:47] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2023-03-23 10:46:47] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 10:46:47] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:47] [INFO ] Invariant cache hit.
[2023-03-23 10:46:47] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2511 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 576 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 105 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) 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 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 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 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 197008 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197008 steps, saw 127888 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:46:51] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:51] [INFO ] Invariant cache hit.
[2023-03-23 10:46:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:46:51] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:46:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:53] [INFO ] After 1227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:46:53] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:54] [INFO ] After 1016ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:46:54] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-23 10:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-23 10:46:55] [INFO ] After 1995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 681 ms.
[2023-03-23 10:46:55] [INFO ] After 4092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 9 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 69 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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 29 ms. (steps per millisecond=344 ) 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 10:46:56] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:46:56] [INFO ] Invariant cache hit.
[2023-03-23 10:46:56] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:46:56] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:46:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:46:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:46:57] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:57] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:46:58] [INFO ] After 717ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:46:58] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2023-03-23 10:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-23 10:46:59] [INFO ] After 1620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 479 ms.
[2023-03-23 10:46:59] [INFO ] After 2990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 72 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 641/641 places, 1670/1670 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 183635 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183635 steps, saw 119208 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 10:47:03] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:03] [INFO ] Invariant cache hit.
[2023-03-23 10:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:47:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 10:47:03] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:47:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:47:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:47:04] [INFO ] After 764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:47:04] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:47:05] [INFO ] After 724ms SMT Verify possible using 274 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:47:05] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-23 10:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-23 10:47:06] [INFO ] After 1623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 476 ms.
[2023-03-23 10:47:06] [INFO ] After 3002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1670/1670 transitions.
Applied a total of 0 rules in 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 69 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-23 10:47:06] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:06] [INFO ] Invariant cache hit.
[2023-03-23 10:47:06] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-23 10:47:06] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:06] [INFO ] Invariant cache hit.
[2023-03-23 10:47:07] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:47:08] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-23 10:47:08] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 10:47:08] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:08] [INFO ] Invariant cache hit.
[2023-03-23 10:47:08] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2384 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 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 187 place count 420 transition count 831
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 250 place count 357 transition count 768
Iterating global reduction 2 with 63 rules applied. Total rules applied 313 place count 357 transition count 768
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 439 place count 357 transition count 642
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 701 place count 226 transition count 511
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 765 place count 162 transition count 383
Iterating global reduction 3 with 64 rules applied. Total rules applied 829 place count 162 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 830 place count 162 transition count 382
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 893 place count 99 transition count 256
Iterating global reduction 4 with 63 rules applied. Total rules applied 956 place count 99 transition count 256
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1019 place count 36 transition count 130
Iterating global reduction 4 with 63 rules applied. Total rules applied 1082 place count 36 transition count 130
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1145 place count 36 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1145 place count 36 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1147 place count 35 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1149 place count 34 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1157 place count 30 transition count 65
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1164 place count 30 transition count 58
Applied a total of 1164 rules in 30 ms. Remains 30 /641 variables (removed 611) and now considering 58/1670 (removed 1612) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 58 rows 30 cols
[2023-03-23 10:47:08] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 10:47:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:47:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:47:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 10:47:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:47:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:47:09] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 10:47:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:47:09] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 10:47:09] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-23 10:47:09] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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 : [(F p2), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 605 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 126 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
[2023-03-23 10:47:10] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
// Phase 1: matrix 1116 rows 641 cols
[2023-03-23 10:47:10] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-23 10:47:11] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:47:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-23 10:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 10:47:12] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2023-03-23 10:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 10:47:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 29 ms returned sat
[2023-03-23 10:47:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 10:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 10:47:13] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-23 10:47:13] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:47:13] [INFO ] [Nat]Added 274 Read/Feed constraints in 91 ms returned sat
[2023-03-23 10:47:13] [INFO ] Computed and/alt/rep : 227/365/216 causal constraints (skipped 898 transitions) in 113 ms.
[2023-03-23 10:47:13] [INFO ] Added : 10 causal constraints over 2 iterations in 311 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 487 ms.
Product exploration explored 100000 steps with 0 reset in 544 ms.
Built C files in :
/tmp/ltsmin14724330370882950333
[2023-03-23 10:47:15] [INFO ] Too many transitions (1670) to apply POR reductions. Disabling POR matrices.
[2023-03-23 10:47:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14724330370882950333
Running compilation step : cd /tmp/ltsmin14724330370882950333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2909 ms.
Running link step : cd /tmp/ltsmin14724330370882950333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14724330370882950333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8830771492456803399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 86 ms. Remains 641 /641 variables (removed 0) and now considering 1670/1670 (removed 0) transitions.
[2023-03-23 10:47:30] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:30] [INFO ] Invariant cache hit.
[2023-03-23 10:47:30] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-23 10:47:30] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:30] [INFO ] Invariant cache hit.
[2023-03-23 10:47:30] [INFO ] State equation strengthened by 274 read => feed constraints.
[2023-03-23 10:47:32] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-23 10:47:32] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-23 10:47:32] [INFO ] Flow matrix only has 1116 transitions (discarded 554 similar events)
[2023-03-23 10:47:32] [INFO ] Invariant cache hit.
[2023-03-23 10:47:32] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2515 ms. Remains : 641/641 places, 1670/1670 transitions.
Built C files in :
/tmp/ltsmin9533612876126695335
[2023-03-23 10:47:32] [INFO ] Too many transitions (1670) to apply POR reductions. Disabling POR matrices.
[2023-03-23 10:47:32] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9533612876126695335
Running compilation step : cd /tmp/ltsmin9533612876126695335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2918 ms.
Running link step : cd /tmp/ltsmin9533612876126695335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9533612876126695335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17594817780522299107.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-23 10:47:47] [INFO ] Flatten gal took : 34 ms
[2023-03-23 10:47:47] [INFO ] Flatten gal took : 35 ms
[2023-03-23 10:47:47] [INFO ] Time to serialize gal into /tmp/LTL439478322649711303.gal : 6 ms
[2023-03-23 10:47:47] [INFO ] Time to serialize properties into /tmp/LTL3825695285362995278.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL439478322649711303.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3300245138274741248.hoa' '-atoms' '/tmp/LTL3825695285362995278.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3825695285362995278.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3300245138274741248.hoa
Detected timeout of ITS tools.
[2023-03-23 10:48:03] [INFO ] Flatten gal took : 45 ms
[2023-03-23 10:48:03] [INFO ] Flatten gal took : 34 ms
[2023-03-23 10:48:03] [INFO ] Time to serialize gal into /tmp/LTL2956996818962350686.gal : 7 ms
[2023-03-23 10:48:03] [INFO ] Time to serialize properties into /tmp/LTL7726580377878665400.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2956996818962350686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7726580377878665400.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((s0>=1)&&(l1682>=1))"))U((G(!("((s0>=1)&&(l2166>=1))")))U("((s1>=1)&&(l1658>=1))"))))
Formula 0 simplified : G!"((s0>=1)&&(l1682>=1))" R (F"((s0>=1)&&(l2166>=1))" R !"((s1>=1)&&(l1658>=1))")
Detected timeout of ITS tools.
[2023-03-23 10:48:18] [INFO ] Flatten gal took : 34 ms
[2023-03-23 10:48:18] [INFO ] Applying decomposition
[2023-03-23 10:48:18] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12612683228522284511.txt' '-o' '/tmp/graph12612683228522284511.bin' '-w' '/tmp/graph12612683228522284511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12612683228522284511.bin' '-l' '-1' '-v' '-w' '/tmp/graph12612683228522284511.weights' '-q' '0' '-e' '0.001'
[2023-03-23 10:48:18] [INFO ] Decomposing Gal with order
[2023-03-23 10:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 10:48:18] [INFO ] Removed a total of 2781 redundant transitions.
[2023-03-23 10:48:18] [INFO ] Flatten gal took : 67 ms
[2023-03-23 10:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1247 labels/synchronizations in 42 ms.
[2023-03-23 10:48:18] [INFO ] Time to serialize gal into /tmp/LTL6515337922102947319.gal : 9 ms
[2023-03-23 10:48:18] [INFO ] Time to serialize properties into /tmp/LTL1561965444744110916.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6515337922102947319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1561965444744110916.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.u0.s0>=1)&&(i22.i3.u146.l1682>=1))"))U((G(!("((i0.u0.s0>=1)&&(i22.i5.u149.l2166>=1))")))U("((i7.u1.s1>=1)&&(i22.i3.u146.l1...168
Formula 0 simplified : G!"((i0.u0.s0>=1)&&(i22.i3.u146.l1682>=1))" R (F"((i0.u0.s0>=1)&&(i22.i5.u149.l2166>=1))" R !"((i7.u1.s1>=1)&&(i22.i3.u146.l1658>=1)...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9580031450853293124
[2023-03-23 10:48:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9580031450853293124
Running compilation step : cd /tmp/ltsmin9580031450853293124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2941 ms.
Running link step : cd /tmp/ltsmin9580031450853293124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9580031450853293124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U ([](!(LTLAPp1==true)) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 374 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c004-LTLFireability-07 finished in 133995 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 343 ms. Remains 633 /740 variables (removed 107) and now considering 1648/1928 (removed 280) transitions.
[2023-03-23 10:48:37] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-23 10:48:37] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-23 10:48:37] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-23 10:48:37] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:48:37] [INFO ] Invariant cache hit.
[2023-03-23 10:48:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:48:38] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2023-03-23 10:48:38] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-23 10:48:38] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:48:38] [INFO ] Invariant cache hit.
[2023-03-23 10:48:39] [INFO ] Dead Transitions using invariants and state equation in 552 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 2666 ms. Remains : 633/740 places, 1648/1928 transitions.
Stuttering acceptance computed with spot in 90 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 472 ms.
Stack based approach found an accepted trace after 248 steps with 0 reset with depth 249 and stack size 249 in 2 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 3254 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 144 ms. Remains 605 /740 variables (removed 135) and now considering 1586/1928 (removed 342) transitions.
[2023-03-23 10:48:40] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-23 10:48:40] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 10:48:40] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-23 10:48:40] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:48:40] [INFO ] Invariant cache hit.
[2023-03-23 10:48:40] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 10:48:42] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2023-03-23 10:48:42] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:48:42] [INFO ] Invariant cache hit.
[2023-03-23 10:48:42] [INFO ] Dead Transitions using invariants and state equation in 508 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 2420 ms. Remains : 605/740 places, 1586/1928 transitions.
Stuttering acceptance computed with spot in 78 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 1 reset in 450 ms.
Product exploration explored 100000 steps with 0 reset in 506 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 144 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)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 500871 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500871 steps, saw 325098 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:48:46] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:48:46] [INFO ] Invariant cache hit.
[2023-03-23 10:48:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:48:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:48:47] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:48:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:48:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:48:47] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:47] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 10:48:48] [INFO ] After 291ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:48] [INFO ] After 429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-23 10:48:48] [INFO ] After 999ms 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 87 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 564809 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564809 steps, saw 346331 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:48:51] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2023-03-23 10:48:51] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 10:48:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 10:48:51] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:48:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 10:48:52] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:48:52] [INFO ] After 102ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:52] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-23 10:48:52] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 42 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-23 10:48:52] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-23 10:48:52] [INFO ] Invariant cache hit.
[2023-03-23 10:48:52] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-23 10:48:52] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-23 10:48:52] [INFO ] Invariant cache hit.
[2023-03-23 10:48:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 10:48:53] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-23 10:48:53] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 10:48:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2023-03-23 10:48:53] [INFO ] Invariant cache hit.
[2023-03-23 10:48:54] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1539 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 32 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-23 10:48:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 10:48:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 10:48:54] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:48:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 10:48:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:48:54] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:48:54] [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-23 10:48:54] [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 166 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 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 15 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2023-03-23 10:48:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2023-03-23 10:48:54] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-23 10:48:54] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-23 10:48:54] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:48:54] [INFO ] Invariant cache hit.
[2023-03-23 10:48:55] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 10:48:56] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2023-03-23 10:48:56] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:48:56] [INFO ] Invariant cache hit.
[2023-03-23 10:48:56] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2264 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 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511692 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511692 steps, saw 332120 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:49:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2023-03-23 10:49:00] [INFO ] Invariant cache hit.
[2023-03-23 10:49:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:00] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:49:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:01] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:01] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-23 10:49:01] [INFO ] After 286ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:01] [INFO ] After 419ms 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-23 10:49:01] [INFO ] After 968ms 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 90 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 91 ms. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 3527 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=881 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 399 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 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 164 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2023-03-23 10:49:03] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 10:49:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-23 10:49:03] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 10:49:03] [INFO ] Dead Transitions using invariants and state equation in 470 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 675 ms. Remains : 605/605 places, 1584/1586 transitions.
Built C files in :
/tmp/ltsmin9042576338225083873
[2023-03-23 10:49:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9042576338225083873
Running compilation step : cd /tmp/ltsmin9042576338225083873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2792 ms.
Running link step : cd /tmp/ltsmin9042576338225083873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9042576338225083873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1569570962823588019.hoa' '--buchi-type=spotba'
LTSmin run took 732 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c004-LTLFireability-09 finished in 27342 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 166 ms. Remains 620 /740 variables (removed 120) and now considering 1624/1928 (removed 304) transitions.
[2023-03-23 10:49:07] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2023-03-23 10:49:07] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 10:49:08] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-23 10:49:08] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:08] [INFO ] Invariant cache hit.
[2023-03-23 10:49:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:09] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2023-03-23 10:49:09] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:09] [INFO ] Invariant cache hit.
[2023-03-23 10:49:09] [INFO ] Dead Transitions using invariants and state equation in 476 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 2464 ms. Remains : 620/740 places, 1624/1928 transitions.
Stuttering acceptance computed with spot in 154 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 444 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-10 finished in 3085 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 154 ms. Remains 623 /740 variables (removed 117) and now considering 1630/1928 (removed 298) transitions.
[2023-03-23 10:49:10] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-23 10:49:10] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 10:49:11] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-23 10:49:11] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:11] [INFO ] Invariant cache hit.
[2023-03-23 10:49:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:12] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-03-23 10:49:12] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:12] [INFO ] Invariant cache hit.
[2023-03-23 10:49:13] [INFO ] Dead Transitions using invariants and state equation in 493 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 2457 ms. Remains : 623/740 places, 1630/1928 transitions.
Stuttering acceptance computed with spot in 157 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 746 ms.
Product exploration explored 100000 steps with 25000 reset in 690 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 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 143 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 105 ms. (steps per millisecond=95 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 277207 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277207 steps, saw 179939 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 10:49:18] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:18] [INFO ] Invariant cache hit.
[2023-03-23 10:49:18] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:18] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:49:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:19] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:19] [INFO ] After 380ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:19] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2023-03-23 10:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-23 10:49:20] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-23 10:49:20] [INFO ] After 1853ms 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 137 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 137 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) 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 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 249982 steps, run timeout after 3002 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249982 steps, saw 162269 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 10:49:23] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-23 10:49:23] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-23 10:49:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:24] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:49:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:49:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:24] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:24] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:25] [INFO ] After 383ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:25] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2023-03-23 10:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-23 10:49:25] [INFO ] After 929ms 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-23 10:49:25] [INFO ] After 1877ms 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 69 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-23 10:49:26] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:26] [INFO ] Invariant cache hit.
[2023-03-23 10:49:26] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-23 10:49:26] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:26] [INFO ] Invariant cache hit.
[2023-03-23 10:49:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:27] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2023-03-23 10:49:27] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-23 10:49:27] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:27] [INFO ] Invariant cache hit.
[2023-03-23 10:49:28] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2199 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 1 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 26 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-23 10:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 10:49:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:49:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:28] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-23 10:49:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:49:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 10:49:28] [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-23 10:49:28] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-23 10:49:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:49:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:28] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:28] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:28] [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 11 ms.
[2023-03-23 10:49:28] [INFO ] After 72ms 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 100 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 158 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 143 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-23 10:49:28] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2023-03-23 10:49:28] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-23 10:49:29] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-23 10:49:29] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:29] [INFO ] Invariant cache hit.
[2023-03-23 10:49:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:32] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned []
Implicit Place search using SMT with State Equation took 3720 ms to find 0 implicit places.
[2023-03-23 10:49:32] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:32] [INFO ] Invariant cache hit.
[2023-03-23 10:49:33] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4516 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 97 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 157 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 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 252976 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252976 steps, saw 164214 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 10:49:36] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2023-03-23 10:49:36] [INFO ] Invariant cache hit.
[2023-03-23 10:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:37] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 10:49:37] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:37] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:38] [INFO ] After 388ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 10:49:38] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-23 10:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-23 10:49:38] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-23 10:49:39] [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, 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 143 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 144 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:49:39] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-23 10:49:39] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-23 10:49:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:39] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:49:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-23 10:49:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:40] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:40] [INFO ] After 202ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:40] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 2 ms to minimize.
[2023-03-23 10:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-23 10:49:41] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-23 10:49:41] [INFO ] After 1169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 74 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 74 ms. Remains : 623/623 places, 1624/1624 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466458 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466458 steps, saw 302762 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 10:49:44] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:44] [INFO ] Invariant cache hit.
[2023-03-23 10:49:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:44] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:49:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:49:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:45] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:45] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:45] [INFO ] After 205ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:45] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2023-03-23 10:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-23 10:49:45] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-23 10:49:45] [INFO ] After 1155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 70 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 65 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2023-03-23 10:49:46] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:46] [INFO ] Invariant cache hit.
[2023-03-23 10:49:46] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-23 10:49:46] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:46] [INFO ] Invariant cache hit.
[2023-03-23 10:49:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-23 10:49:47] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2023-03-23 10:49:47] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-23 10:49:47] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2023-03-23 10:49:47] [INFO ] Invariant cache hit.
[2023-03-23 10:49:48] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2189 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 23 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 24 cols
[2023-03-23 10:49:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 10:49:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:49:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:49:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 10:49:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:49:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:49:48] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:49:48] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 10:49:48] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 10:49:48] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 355 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 147 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 173 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 656 ms.
Product exploration explored 100000 steps with 25000 reset in 663 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 176 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 147 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
[2023-03-23 10:49:50] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-23 10:49:50] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2023-03-23 10:49:50] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-23 10:49:51] [INFO ] Dead Transitions using invariants and state equation in 532 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 720 ms. Remains : 623/623 places, 1624/1630 transitions.
Built C files in :
/tmp/ltsmin18233868197472159255
[2023-03-23 10:49:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18233868197472159255
Running compilation step : cd /tmp/ltsmin18233868197472159255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2966 ms.
Running link step : cd /tmp/ltsmin18233868197472159255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18233868197472159255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5099543239831494385.hoa' '--buchi-type=spotba'
LTSmin run took 418 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 44318 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 175 ms. Remains 633 /740 variables (removed 107) and now considering 1656/1928 (removed 272) transitions.
[2023-03-23 10:49:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:49:55] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-23 10:49:55] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-23 10:49:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:49:55] [INFO ] Invariant cache hit.
[2023-03-23 10:49:56] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:49:57] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-03-23 10:49:57] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:49:57] [INFO ] Invariant cache hit.
[2023-03-23 10:49:57] [INFO ] Dead Transitions using invariants and state equation in 528 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 2698 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 478 ms.
Product exploration explored 100000 steps with 0 reset in 478 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 1541 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 172 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 238 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 147004 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 147004 steps, saw 95435 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:50:04] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:50:04] [INFO ] Invariant cache hit.
[2023-03-23 10:50:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:50:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:04] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:50:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:50:06] [INFO ] After 1387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:06] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:07] [INFO ] After 1318ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:07] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 1 ms to minimize.
[2023-03-23 10:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-23 10:50:08] [INFO ] After 2657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1071 ms.
[2023-03-23 10:50:10] [INFO ] After 5304ms 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 16 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 146 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 146 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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 172848 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172848 steps, saw 112208 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:50:13] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-23 10:50:13] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-23 10:50:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:50:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 10:50:14] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:50:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:15] [INFO ] After 1398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:15] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:16] [INFO ] After 1169ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:17] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 1 ms to minimize.
[2023-03-23 10:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-23 10:50:18] [INFO ] After 2479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 754 ms.
[2023-03-23 10:50:18] [INFO ] After 4824ms 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 76 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-23 10:50:19] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:19] [INFO ] Invariant cache hit.
[2023-03-23 10:50:19] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-23 10:50:19] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:19] [INFO ] Invariant cache hit.
[2023-03-23 10:50:19] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:21] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2023-03-23 10:50:21] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 10:50:21] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:21] [INFO ] Invariant cache hit.
[2023-03-23 10:50:21] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2645 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 1 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 34 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-23 10:50:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 10:50:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:50:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:21] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 10:50:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:21] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:50:21] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:21] [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 23 ms.
[2023-03-23 10:50:21] [INFO ] After 134ms 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 645 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 144 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 14 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-23 10:50:22] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:50:22] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 10:50:23] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-23 10:50:23] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:50:23] [INFO ] Invariant cache hit.
[2023-03-23 10:50:23] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:24] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2023-03-23 10:50:24] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:50:24] [INFO ] Invariant cache hit.
[2023-03-23 10:50:25] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2601 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 1031 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 120 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 116 ms. (steps per millisecond=86 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 206490 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206490 steps, saw 134044 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:50:29] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:50:29] [INFO ] Invariant cache hit.
[2023-03-23 10:50:29] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:50:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 10:50:30] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-23 10:50:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:50:31] [INFO ] After 1381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:31] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:33] [INFO ] After 1327ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:33] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 0 ms to minimize.
[2023-03-23 10:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-23 10:50:34] [INFO ] After 2618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1090 ms.
[2023-03-23 10:50:35] [INFO ] After 5260ms 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 4 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 141 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
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 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 206119 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206119 steps, saw 133802 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 10:50:39] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2023-03-23 10:50:39] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-23 10:50:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:50:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:39] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-23 10:50:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:41] [INFO ] After 1359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:42] [INFO ] After 1156ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:42] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-23 10:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-23 10:50:43] [INFO ] After 2442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 743 ms.
[2023-03-23 10:50:44] [INFO ] After 4720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 11 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 68 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 68 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 70 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2023-03-23 10:50:44] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:44] [INFO ] Invariant cache hit.
[2023-03-23 10:50:44] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-23 10:50:44] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:44] [INFO ] Invariant cache hit.
[2023-03-23 10:50:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:50:46] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2023-03-23 10:50:46] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 10:50:46] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2023-03-23 10:50:46] [INFO ] Invariant cache hit.
[2023-03-23 10:50:46] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2381 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 1 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 32 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-23 10:50:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 10:50:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:50:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 10:50:46] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:50:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 10:50:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 10:50:46] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:50:46] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 10:50:47] [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 22 ms.
[2023-03-23 10:50:47] [INFO ] After 129ms 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 628 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 121 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 130 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 120 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 425 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Built C files in :
/tmp/ltsmin6777926130050430821
[2023-03-23 10:50:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6777926130050430821
Running compilation step : cd /tmp/ltsmin6777926130050430821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2991 ms.
Running link step : cd /tmp/ltsmin6777926130050430821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6777926130050430821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14900186370957880305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 14 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2023-03-23 10:51:04] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2023-03-23 10:51:04] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-23 10:51:04] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-23 10:51:04] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:51:04] [INFO ] Invariant cache hit.
[2023-03-23 10:51:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2023-03-23 10:51:06] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-03-23 10:51:06] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2023-03-23 10:51:06] [INFO ] Invariant cache hit.
[2023-03-23 10:51:06] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2355 ms. Remains : 633/633 places, 1656/1656 transitions.
Built C files in :
/tmp/ltsmin16534094303449926456
[2023-03-23 10:51:06] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16534094303449926456
Running compilation step : cd /tmp/ltsmin16534094303449926456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16534094303449926456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16534094303449926456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-23 10:51:09] [INFO ] Flatten gal took : 33 ms
[2023-03-23 10:51:09] [INFO ] Flatten gal took : 35 ms
[2023-03-23 10:51:09] [INFO ] Time to serialize gal into /tmp/LTL10367727077526654091.gal : 10 ms
[2023-03-23 10:51:09] [INFO ] Time to serialize properties into /tmp/LTL15775905266702012848.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10367727077526654091.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13015717722055208756.hoa' '-atoms' '/tmp/LTL15775905266702012848.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15775905266702012848.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13015717722055208756.hoa
Detected timeout of ITS tools.
[2023-03-23 10:51:24] [INFO ] Flatten gal took : 37 ms
[2023-03-23 10:51:24] [INFO ] Flatten gal took : 37 ms
[2023-03-23 10:51:24] [INFO ] Time to serialize gal into /tmp/LTL3387099177729556019.gal : 7 ms
[2023-03-23 10:51:24] [INFO ] Time to serialize properties into /tmp/LTL14658212381066566908.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3387099177729556019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14658212381066566908.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2144<1))")||((X(("((s0>=1)&&(l2076>=1))")||(G("((s0>=1)&&(l1636>=1))"))))||(F("((s0>=1)&&(l1636>=1))")))))))
Formula 0 simplified : G(F(!"((s0<1)||(l2144<1))" & X(!"((s0>=1)&&(l2076>=1))" & F!"((s0>=1)&&(l1636>=1))")) & FG!"((s0>=1)&&(l1636>=1))")
Detected timeout of ITS tools.
[2023-03-23 10:51:39] [INFO ] Flatten gal took : 34 ms
[2023-03-23 10:51:39] [INFO ] Applying decomposition
[2023-03-23 10:51:39] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6953183317901209015.txt' '-o' '/tmp/graph6953183317901209015.bin' '-w' '/tmp/graph6953183317901209015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6953183317901209015.bin' '-l' '-1' '-v' '-w' '/tmp/graph6953183317901209015.weights' '-q' '0' '-e' '0.001'
[2023-03-23 10:51:40] [INFO ] Decomposing Gal with order
[2023-03-23 10:51:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 10:51:40] [INFO ] Removed a total of 2763 redundant transitions.
[2023-03-23 10:51:40] [INFO ] Flatten gal took : 67 ms
[2023-03-23 10:51:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1138 labels/synchronizations in 40 ms.
[2023-03-23 10:51:40] [INFO ] Time to serialize gal into /tmp/LTL214665507212117911.gal : 10 ms
[2023-03-23 10:51:40] [INFO ] Time to serialize properties into /tmp/LTL13742207270530914757.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL214665507212117911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13742207270530914757.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i27.i0.i2.u153.l2144<1))")||((X(("((i0.u0.s0>=1)&&(i27.i1.i2.u152.l2076>=1))")||(G("((i0.u0.s0>=1)&&(i27.i0.i...233
Formula 0 simplified : G(F(!"((i0.u0.s0<1)||(i27.i0.i2.u153.l2144<1))" & X(!"((i0.u0.s0>=1)&&(i27.i1.i2.u152.l2076>=1))" & F!"((i0.u0.s0>=1)&&(i27.i0.i0.u1...222
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8176232443192917798
[2023-03-23 10:51:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8176232443192917798
Running compilation step : cd /tmp/ltsmin8176232443192917798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2952 ms.
Running link step : cd /tmp/ltsmin8176232443192917798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8176232443192917798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp1==true)||[]((LTLAPp2==true))))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 135460 ms.
[2023-03-23 10:52:10] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12069863152359905716
[2023-03-23 10:52:10] [INFO ] Too many transitions (1928) to apply POR reductions. Disabling POR matrices.
[2023-03-23 10:52:10] [INFO ] Applying decomposition
[2023-03-23 10:52:10] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12069863152359905716
Running compilation step : cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-23 10:52:10] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4547920063663808014.txt' '-o' '/tmp/graph4547920063663808014.bin' '-w' '/tmp/graph4547920063663808014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4547920063663808014.bin' '-l' '-1' '-v' '-w' '/tmp/graph4547920063663808014.weights' '-q' '0' '-e' '0.001'
[2023-03-23 10:52:10] [INFO ] Decomposing Gal with order
[2023-03-23 10:52:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 10:52:10] [INFO ] Removed a total of 3231 redundant transitions.
[2023-03-23 10:52:10] [INFO ] Flatten gal took : 80 ms
[2023-03-23 10:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1474 labels/synchronizations in 49 ms.
[2023-03-23 10:52:10] [INFO ] Time to serialize gal into /tmp/LTLFireability4041358157314213489.gal : 11 ms
[2023-03-23 10:52:10] [INFO ] Time to serialize properties into /tmp/LTLFireability4434241474451425245.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4041358157314213489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4434241474451425245.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F("((i7.i0.u2.s1<1)||(i35.i1.u184.l1638<1))"))))
Formula 0 simplified : FG!"((i7.i0.u2.s1<1)||(i35.i1.u184.l1638<1))"
Compilation finished in 3678 ms.
Running link step : cd /tmp/ltsmin12069863152359905716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 11:15:41] [INFO ] Flatten gal took : 71 ms
[2023-03-23 11:15:41] [INFO ] Time to serialize gal into /tmp/LTLFireability15834619749774212657.gal : 24 ms
[2023-03-23 11:15:41] [INFO ] Time to serialize properties into /tmp/LTLFireability233025227433210674.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15834619749774212657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability233025227433210674.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1638<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1638<1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp2==true)||[]((LTLAPp3==true))))||<>((LTLAPp3==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: LTL layer: formula: <>([]((X(((LTLAPp2==true)||[]((LTLAPp3==true))))||<>((LTLAPp3==true))||(LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.023: "<>([]((X(((LTLAPp2==true)||[]((LTLAPp3==true))))||<>((LTLAPp3==true))||(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.338: There are 1933 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.338: State length is 741, there are 1934 groups
pins2lts-mc-linux64( 0/ 8), 0.338: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.338: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.338: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.338: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.434: [Blue] ~120 levels ~960 states ~3680 transitions
pins2lts-mc-linux64( 6/ 8), 0.512: [Blue] ~240 levels ~1920 states ~8008 transitions
pins2lts-mc-linux64( 6/ 8), 0.678: [Blue] ~480 levels ~3840 states ~16640 transitions
pins2lts-mc-linux64( 6/ 8), 1.031: [Blue] ~960 levels ~7680 states ~33760 transitions
pins2lts-mc-linux64( 6/ 8), 1.645: [Blue] ~1920 levels ~15360 states ~68112 transitions
pins2lts-mc-linux64( 6/ 8), 2.763: [Blue] ~3840 levels ~30720 states ~136752 transitions
pins2lts-mc-linux64( 6/ 8), 9.729: [Blue] ~7680 levels ~61440 states ~274056 transitions
pins2lts-mc-linux64( 6/ 8), 21.444: [Blue] ~15360 levels ~122880 states ~548648 transitions
pins2lts-mc-linux64( 6/ 8), 41.661: [Blue] ~30720 levels ~245760 states ~1097888 transitions
pins2lts-mc-linux64( 6/ 8), 68.625: [Blue] ~61440 levels ~491520 states ~2196352 transitions
pins2lts-mc-linux64( 6/ 8), 107.200: [Blue] ~122880 levels ~983040 states ~4393280 transitions
pins2lts-mc-linux64( 6/ 8), 184.258: [Blue] ~245760 levels ~1966080 states ~8787208 transitions
pins2lts-mc-linux64( 5/ 8), 341.427: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 341.631:
pins2lts-mc-linux64( 0/ 8), 341.631: Explored 3714517 states 20772688 transitions, fanout: 5.592
pins2lts-mc-linux64( 0/ 8), 341.631: Total exploration time 341.260 sec (341.060 sec minimum, 341.164 sec on average)
pins2lts-mc-linux64( 0/ 8), 341.631: States per second: 10885, Transitions per second: 60871
pins2lts-mc-linux64( 0/ 8), 341.631:
pins2lts-mc-linux64( 0/ 8), 341.631: State space has 19282327 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 341.631: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 341.631: blue states: 3714517 (19.26%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 341.632: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 341.632: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 341.632:
pins2lts-mc-linux64( 0/ 8), 341.632: Total memory used for local state coloring: 56.7MB
pins2lts-mc-linux64( 0/ 8), 341.632:
pins2lts-mc-linux64( 0/ 8), 341.632: Queue width: 8B, total height: 3714517, memory: 28.34MB
pins2lts-mc-linux64( 0/ 8), 341.632: Tree memory: 403.1MB, 21.9 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 341.632: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 341.632: Stored 1952 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 341.632: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 341.632: Est. total memory use: 431.5MB (~1052.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp2==true)||[]((LTLAPp3==true))))||<>((LTLAPp3==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12069863152359905716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp2==true)||[]((LTLAPp3==true))))||<>((LTLAPp3==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-23 11:39:17] [INFO ] Flatten gal took : 1528 ms
[2023-03-23 11:39:35] [INFO ] Input system was already deterministic with 1928 transitions.
[2023-03-23 11:39:36] [INFO ] Transformed 740 places.
[2023-03-23 11:39:36] [INFO ] Transformed 1928 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 11:39:37] [INFO ] Time to serialize gal into /tmp/LTLFireability11136948776941367881.gal : 244 ms
[2023-03-23 11:39:37] [INFO ] Time to serialize properties into /tmp/LTLFireability3125057614225467299.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11136948776941367881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3125057614225467299.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l1638<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1638<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12940612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15638812 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-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 r165-tall-167838850800724"
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 '
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 ;