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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
799.487 68836.00 105660.00 534.90 FFFFFFFTTFTFTFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 11K Feb 25 12:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 12:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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-c032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678635757998

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:42:39] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2023-03-12 15:42:39] [INFO ] Transformed 2826 places.
[2023-03-12 15:42:39] [INFO ] Transformed 8960 transitions.
[2023-03-12 15:42:40] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 488 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 4 formulas.
Deduced a syphon composed of 1198 places in 31 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-c032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c032-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 314 place count 1314 transition count 3728
Iterating global reduction 1 with 297 rules applied. Total rules applied 611 place count 1314 transition count 3728
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 390 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 1001 place count 1314 transition count 3338
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1153 place count 1162 transition count 3034
Iterating global reduction 2 with 152 rules applied. Total rules applied 1305 place count 1162 transition count 3034
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 1385 place count 1162 transition count 2954
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1399 place count 1148 transition count 2926
Iterating global reduction 3 with 14 rules applied. Total rules applied 1413 place count 1148 transition count 2926
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1427 place count 1134 transition count 2898
Iterating global reduction 3 with 14 rules applied. Total rules applied 1441 place count 1134 transition count 2898
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1455 place count 1120 transition count 2870
Iterating global reduction 3 with 14 rules applied. Total rules applied 1469 place count 1120 transition count 2870
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1482 place count 1107 transition count 2844
Iterating global reduction 3 with 13 rules applied. Total rules applied 1495 place count 1107 transition count 2844
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1508 place count 1094 transition count 2818
Iterating global reduction 3 with 13 rules applied. Total rules applied 1521 place count 1094 transition count 2818
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1534 place count 1081 transition count 2792
Iterating global reduction 3 with 13 rules applied. Total rules applied 1547 place count 1081 transition count 2792
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1560 place count 1068 transition count 2766
Iterating global reduction 3 with 13 rules applied. Total rules applied 1573 place count 1068 transition count 2766
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1622 place count 1019 transition count 2584
Iterating global reduction 3 with 49 rules applied. Total rules applied 1671 place count 1019 transition count 2584
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1727 place count 963 transition count 2360
Iterating global reduction 3 with 56 rules applied. Total rules applied 1783 place count 963 transition count 2360
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1839 place count 907 transition count 2220
Iterating global reduction 3 with 56 rules applied. Total rules applied 1895 place count 907 transition count 2220
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1951 place count 851 transition count 2108
Iterating global reduction 3 with 56 rules applied. Total rules applied 2007 place count 851 transition count 2108
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2062 place count 796 transition count 1998
Iterating global reduction 3 with 55 rules applied. Total rules applied 2117 place count 796 transition count 1998
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2172 place count 741 transition count 1888
Iterating global reduction 3 with 55 rules applied. Total rules applied 2227 place count 741 transition count 1888
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2282 place count 686 transition count 1778
Iterating global reduction 3 with 55 rules applied. Total rules applied 2337 place count 686 transition count 1778
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 2350 place count 673 transition count 1752
Iterating global reduction 3 with 13 rules applied. Total rules applied 2363 place count 673 transition count 1752
Applied a total of 2363 rules in 1262 ms. Remains 673 /1628 variables (removed 955) and now considering 1752/5962 (removed 4210) transitions.
[2023-03-12 15:42:41] [INFO ] Flow matrix only has 1174 transitions (discarded 578 similar events)
// Phase 1: matrix 1174 rows 673 cols
[2023-03-12 15:42:41] [INFO ] Computed 2 place invariants in 33 ms
[2023-03-12 15:42:42] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-12 15:42:42] [INFO ] Flow matrix only has 1174 transitions (discarded 578 similar events)
[2023-03-12 15:42:42] [INFO ] Invariant cache hit.
[2023-03-12 15:42:42] [INFO ] State equation strengthened by 287 read => feed constraints.
[2023-03-12 15:42:45] [INFO ] Implicit Places using invariants and state equation in 2764 ms returned []
Implicit Place search using SMT with State Equation took 3502 ms to find 0 implicit places.
[2023-03-12 15:42:45] [INFO ] Flow matrix only has 1174 transitions (discarded 578 similar events)
[2023-03-12 15:42:45] [INFO ] Invariant cache hit.
[2023-03-12 15:42:45] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 673/1628 places, 1752/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5344 ms. Remains : 673/1628 places, 1752/5962 transitions.
Support contains 13 out of 673 places after structural reductions.
[2023-03-12 15:42:45] [INFO ] Flatten gal took : 139 ms
[2023-03-12 15:42:46] [INFO ] Flatten gal took : 90 ms
[2023-03-12 15:42:46] [INFO ] Input system was already deterministic with 1752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 187826 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187826 steps, saw 121930 distinct states, run finished after 3006 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 15:42:49] [INFO ] Flow matrix only has 1174 transitions (discarded 578 similar events)
[2023-03-12 15:42:49] [INFO ] Invariant cache hit.
[2023-03-12 15:42:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:42:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:42:51] [INFO ] After 1918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 15:42:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:42:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:42:53] [INFO ] After 1163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 15:42:53] [INFO ] State equation strengthened by 287 read => feed constraints.
[2023-03-12 15:42:54] [INFO ] After 1045ms SMT Verify possible using 287 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 15:42:55] [INFO ] After 2010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 643 ms.
[2023-03-12 15:42:55] [INFO ] After 4118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 116 ms.
Support contains 12 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 672 transition count 1750
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 672 transition count 1750
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 672 transition count 1748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 671 transition count 1746
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 671 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 670 transition count 1744
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 670 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 669 transition count 1742
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 669 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 668 transition count 1740
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 668 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 667 transition count 1736
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 667 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 666 transition count 1732
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 666 transition count 1732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 665 transition count 1730
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 665 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 664 transition count 1728
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 664 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 663 transition count 1726
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 663 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 662 transition count 1724
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 662 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 661 transition count 1722
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 661 transition count 1722
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 40 place count 661 transition count 1708
Applied a total of 40 rules in 542 ms. Remains 661 /673 variables (removed 12) and now considering 1708/1752 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 661/673 places, 1708/1752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 191332 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191332 steps, saw 124205 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 15:42:59] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
// Phase 1: matrix 1148 rows 661 cols
[2023-03-12 15:42:59] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 15:43:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:01] [INFO ] After 1668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 15:43:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:03] [INFO ] After 1157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 15:43:03] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-03-12 15:43:04] [INFO ] After 994ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 15:43:04] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2023-03-12 15:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-12 15:43:05] [INFO ] After 2153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 765 ms.
[2023-03-12 15:43:06] [INFO ] After 4358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 152 ms.
Support contains 12 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1708/1708 transitions.
Applied a total of 0 rules in 87 ms. Remains 661 /661 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 661/661 places, 1708/1708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1708/1708 transitions.
Applied a total of 0 rules in 137 ms. Remains 661 /661 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
[2023-03-12 15:43:06] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2023-03-12 15:43:06] [INFO ] Invariant cache hit.
[2023-03-12 15:43:06] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-12 15:43:06] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2023-03-12 15:43:06] [INFO ] Invariant cache hit.
[2023-03-12 15:43:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-03-12 15:43:08] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-12 15:43:08] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-12 15:43:08] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2023-03-12 15:43:08] [INFO ] Invariant cache hit.
[2023-03-12 15:43:09] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3090 ms. Remains : 661/661 places, 1708/1708 transitions.
Graph (trivial) has 996 edges and 661 vertex of which 186 / 661 are part of one of the 62 SCC in 4 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 436 transitions
Reduce isomorphic transitions removed 746 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 537 transition count 951
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 526 transition count 951
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 23 place count 526 transition count 860
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 205 place count 435 transition count 860
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 266 place count 374 transition count 799
Iterating global reduction 2 with 61 rules applied. Total rules applied 327 place count 374 transition count 799
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 449 place count 374 transition count 677
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 711 place count 243 transition count 546
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 775 place count 179 transition count 418
Iterating global reduction 3 with 64 rules applied. Total rules applied 839 place count 179 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 840 place count 179 transition count 417
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 903 place count 116 transition count 291
Iterating global reduction 4 with 63 rules applied. Total rules applied 966 place count 116 transition count 291
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1029 place count 53 transition count 165
Iterating global reduction 4 with 63 rules applied. Total rules applied 1092 place count 53 transition count 165
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1155 place count 53 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1155 place count 53 transition count 101
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 1157 place count 52 transition count 101
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 1159 place count 51 transition count 100
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 1167 place count 47 transition count 100
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1171 place count 47 transition count 96
Applied a total of 1171 rules in 76 ms. Remains 47 /661 variables (removed 614) and now considering 96/1708 (removed 1612) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 96 rows 47 cols
[2023-03-12 15:43:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 15:43:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:43:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 15:43:09] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-12 15:43:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:43:09] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 15:43:09] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 15:43:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:43:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:09] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 15:43:09] [INFO ] After 43ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 15:43:09] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 15:43:09] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA FunctionPointer-PT-c032-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(p0))'
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 665 transition count 1736
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 665 transition count 1736
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 665 transition count 1734
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 658 transition count 1716
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 658 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 651 transition count 1692
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 651 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 645 transition count 1674
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 645 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 639 transition count 1662
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 639 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 633 transition count 1648
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 633 transition count 1648
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 627 transition count 1634
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 627 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 621 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 621 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 617 transition count 1614
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 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 124 place count 614 transition count 1604
Applied a total of 124 rules in 872 ms. Remains 614 /673 variables (removed 59) and now considering 1604/1752 (removed 148) transitions.
[2023-03-12 15:43:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2023-03-12 15:43:10] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 15:43:11] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 15:43:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 15:43:11] [INFO ] Invariant cache hit.
[2023-03-12 15:43:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-12 15:43:12] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2023-03-12 15:43:13] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 15:43:13] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2023-03-12 15:43:13] [INFO ] Invariant cache hit.
[2023-03-12 15:43:13] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/673 places, 1604/1752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3630 ms. Remains : 614/673 places, 1604/1752 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-05 finished in 3857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 666 transition count 1738
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 666 transition count 1738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 666 transition count 1736
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 659 transition count 1718
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 659 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 652 transition count 1694
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 652 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 646 transition count 1676
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 646 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 640 transition count 1664
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 640 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 634 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 634 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 628 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 628 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 622 transition count 1624
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 622 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 618 transition count 1616
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 615 transition count 1610
Applied a total of 118 rules in 224 ms. Remains 615 /673 variables (removed 58) and now considering 1610/1752 (removed 142) transitions.
[2023-03-12 15:43:13] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2023-03-12 15:43:14] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 15:43:16] [INFO ] Implicit Places using invariants in 2173 ms returned []
[2023-03-12 15:43:16] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2023-03-12 15:43:16] [INFO ] Invariant cache hit.
[2023-03-12 15:43:16] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-12 15:43:18] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 4028 ms to find 0 implicit places.
[2023-03-12 15:43:18] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2023-03-12 15:43:18] [INFO ] Invariant cache hit.
[2023-03-12 15:43:18] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/673 places, 1610/1752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4772 ms. Remains : 615/673 places, 1610/1752 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s520 1)), p1:(OR (LT s1 1) (LT s536 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 868 ms.
Product exploration explored 100000 steps with 50000 reset in 743 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-07 finished in 6617 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(F(!p0))||G((F(p2)||(F(!p0)&&F(!p3))||p1)))))'
Support contains 5 out of 673 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 667 transition count 1740
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 667 transition count 1740
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 667 transition count 1738
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 662 transition count 1726
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 662 transition count 1726
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 657 transition count 1708
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 657 transition count 1708
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 652 transition count 1692
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 652 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 647 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 647 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 642 transition count 1670
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 642 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 637 transition count 1658
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 637 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 632 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 628 transition count 1640
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 627 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 625 transition count 1634
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 625 transition count 1628
Applied a total of 104 rules in 374 ms. Remains 625 /673 variables (removed 48) and now considering 1628/1752 (removed 124) transitions.
[2023-03-12 15:43:20] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
// Phase 1: matrix 1090 rows 625 cols
[2023-03-12 15:43:20] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 15:43:21] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-12 15:43:21] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2023-03-12 15:43:21] [INFO ] Invariant cache hit.
[2023-03-12 15:43:21] [INFO ] State equation strengthened by 270 read => feed constraints.
[2023-03-12 15:43:22] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2023-03-12 15:43:23] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 15:43:23] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2023-03-12 15:43:23] [INFO ] Invariant cache hit.
[2023-03-12 15:43:23] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 625/673 places, 1628/1752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3162 ms. Remains : 625/673 places, 1628/1752 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s347 1)), p0:(AND (GEQ s1 1) (GEQ s528 1)), p2:(AND (GEQ s0 1) (GEQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 760 ms.
Product exploration explored 100000 steps with 32 reset in 718 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) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 252738 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252738 steps, saw 164057 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 15:43:28] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2023-03-12 15:43:28] [INFO ] Invariant cache hit.
[2023-03-12 15:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 15:43:28] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 15:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:29] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 15:43:29] [INFO ] State equation strengthened by 270 read => feed constraints.
[2023-03-12 15:43:29] [INFO ] After 329ms SMT Verify possible using 270 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 15:43:30] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-12 15:43:30] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1628/1628 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 624 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 623 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 622 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 622 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 621 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 621 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 616 transition count 1608
Applied a total of 18 rules in 205 ms. Remains 616 /625 variables (removed 9) and now considering 1608/1628 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 616/625 places, 1608/1628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 497574 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497574 steps, saw 322956 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:43:33] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 616 cols
[2023-03-12 15:43:33] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 15:43:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:33] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:34] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:34] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-12 15:43:34] [INFO ] After 335ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:34] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-12 15:43:35] [INFO ] After 1207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1608/1608 transitions.
Applied a total of 0 rules in 84 ms. Remains 616 /616 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 616/616 places, 1608/1608 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1608/1608 transitions.
Applied a total of 0 rules in 69 ms. Remains 616 /616 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2023-03-12 15:43:35] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
[2023-03-12 15:43:35] [INFO ] Invariant cache hit.
[2023-03-12 15:43:35] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 15:43:35] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
[2023-03-12 15:43:35] [INFO ] Invariant cache hit.
[2023-03-12 15:43:35] [INFO ] State equation strengthened by 267 read => feed constraints.
[2023-03-12 15:43:38] [INFO ] Implicit Places using invariants and state equation in 3325 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
[2023-03-12 15:43:39] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-12 15:43:39] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
[2023-03-12 15:43:39] [INFO ] Invariant cache hit.
[2023-03-12 15:43:39] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4268 ms. Remains : 616/616 places, 1608/1608 transitions.
Graph (trivial) has 941 edges and 616 vertex of which 189 / 616 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 721 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 490 transition count 877
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 480 transition count 877
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 21 place count 480 transition count 802
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 171 place count 405 transition count 802
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 233 place count 343 transition count 740
Iterating global reduction 2 with 62 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 419 place count 343 transition count 616
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 216 transition count 489
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 152 transition count 361
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 152 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 152 transition count 360
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 89 transition count 234
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 89 transition count 234
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 26 transition count 108
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 26 transition count 108
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 26 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 26 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 25 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 24 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1122 place count 24 transition count 42
Applied a total of 1122 rules in 31 ms. Remains 24 /616 variables (removed 592) and now considering 42/1608 (removed 1566) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 42 rows 24 cols
[2023-03-12 15:43:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 15:43:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:43:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 15:43:39] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 15:43:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 15:43:39] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 15:43:39] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:39] [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 6 ms.
[2023-03-12 15:43:39] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-12 finished in 19456 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((G(p0)||p1))) U p0))'
Support contains 3 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 666 transition count 1738
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 666 transition count 1738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 666 transition count 1736
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 660 transition count 1722
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 660 transition count 1722
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 654 transition count 1702
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 654 transition count 1702
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 649 transition count 1686
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 649 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 644 transition count 1676
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 644 transition count 1676
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 639 transition count 1664
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 639 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 634 transition count 1652
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 634 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 629 transition count 1642
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 629 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 625 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 622 transition count 1628
Applied a total of 104 rules in 188 ms. Remains 622 /673 variables (removed 51) and now considering 1628/1752 (removed 124) transitions.
[2023-03-12 15:43:40] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2023-03-12 15:43:40] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 15:43:40] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-12 15:43:40] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 15:43:40] [INFO ] Invariant cache hit.
[2023-03-12 15:43:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-12 15:43:42] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-12 15:43:42] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2023-03-12 15:43:42] [INFO ] Invariant cache hit.
[2023-03-12 15:43:42] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 622/673 places, 1628/1752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2837 ms. Remains : 622/673 places, 1628/1752 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s540 1)), p1:(AND (GEQ s0 1) (GEQ s550 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-13 finished in 3047 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(p0))'
Support contains 2 out of 673 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 673/673 places, 1752/1752 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 664 transition count 1734
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 664 transition count 1734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 664 transition count 1732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 656 transition count 1712
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 656 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 648 transition count 1684
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 648 transition count 1684
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 641 transition count 1662
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 641 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 634 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 634 transition count 1648
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 627 transition count 1632
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 627 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 620 transition count 1616
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 620 transition count 1616
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 613 transition count 1602
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 613 transition count 1602
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 608 transition count 1592
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 605 transition count 1584
Applied a total of 140 rules in 348 ms. Remains 605 /673 variables (removed 68) and now considering 1584/1752 (removed 168) transitions.
[2023-03-12 15:43:43] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 15:43:43] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 15:43:43] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-12 15:43:43] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-12 15:43:43] [INFO ] Invariant cache hit.
[2023-03-12 15:43:43] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 15:43:45] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2023-03-12 15:43:45] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-12 15:43:45] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2023-03-12 15:43:45] [INFO ] Invariant cache hit.
[2023-03-12 15:43:45] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/673 places, 1584/1752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2932 ms. Remains : 605/673 places, 1584/1752 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4596 steps with 33 reset in 29 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-15 finished in 3024 ms.
All properties solved by simple procedures.
Total runtime 66373 ms.
ITS solved all properties within timeout

BK_STOP 1678635826834

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856300748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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