About the Execution of LTSMin+red for Anderson-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3068.871 | 961503.00 | 1975818.00 | 1741.90 | TFFFFTFFTFFT?FF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 Anderson-PT-11-LTLCardinality-00
FORMULA_NAME Anderson-PT-11-LTLCardinality-01
FORMULA_NAME Anderson-PT-11-LTLCardinality-02
FORMULA_NAME Anderson-PT-11-LTLCardinality-03
FORMULA_NAME Anderson-PT-11-LTLCardinality-04
FORMULA_NAME Anderson-PT-11-LTLCardinality-05
FORMULA_NAME Anderson-PT-11-LTLCardinality-06
FORMULA_NAME Anderson-PT-11-LTLCardinality-07
FORMULA_NAME Anderson-PT-11-LTLCardinality-08
FORMULA_NAME Anderson-PT-11-LTLCardinality-09
FORMULA_NAME Anderson-PT-11-LTLCardinality-10
FORMULA_NAME Anderson-PT-11-LTLCardinality-11
FORMULA_NAME Anderson-PT-11-LTLCardinality-12
FORMULA_NAME Anderson-PT-11-LTLCardinality-13
FORMULA_NAME Anderson-PT-11-LTLCardinality-14
FORMULA_NAME Anderson-PT-11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717260165740
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:42:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:42:48] [INFO ] Load time of PNML (sax parser for PT used): 520 ms
[2024-06-01 16:42:48] [INFO ] Transformed 749 places.
[2024-06-01 16:42:48] [INFO ] Transformed 3245 transitions.
[2024-06-01 16:42:48] [INFO ] Found NUPN structural information;
[2024-06-01 16:42:48] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 782 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 538 transition count 914
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 538 transition count 914
Applied a total of 422 rules in 172 ms. Remains 538 /749 variables (removed 211) and now considering 914/3245 (removed 2331) transitions.
// Phase 1: matrix 914 rows 538 cols
[2024-06-01 16:42:49] [INFO ] Computed 25 invariants in 67 ms
[2024-06-01 16:42:50] [INFO ] Implicit Places using invariants in 1445 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1493 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/749 places, 914/3245 transitions.
Applied a total of 0 rules in 18 ms. Remains 537 /537 variables (removed 0) and now considering 914/914 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1712 ms. Remains : 537/749 places, 914/3245 transitions.
Support contains 31 out of 537 places after structural reductions.
[2024-06-01 16:42:51] [INFO ] Flatten gal took : 190 ms
[2024-06-01 16:42:51] [INFO ] Flatten gal took : 104 ms
[2024-06-01 16:42:51] [INFO ] Input system was already deterministic with 914 transitions.
Support contains 26 out of 537 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 2488 ms. (16 steps per ms) remains 0/13 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 529 transition count 826
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 529 transition count 826
Applied a total of 16 rules in 48 ms. Remains 529 /537 variables (removed 8) and now considering 826/914 (removed 88) transitions.
// Phase 1: matrix 826 rows 529 cols
[2024-06-01 16:42:52] [INFO ] Computed 24 invariants in 25 ms
[2024-06-01 16:42:53] [INFO ] Implicit Places using invariants in 995 ms returned []
[2024-06-01 16:42:53] [INFO ] Invariant cache hit.
[2024-06-01 16:42:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:42:58] [INFO ] Implicit Places using invariants and state equation in 4510 ms returned []
Implicit Place search using SMT with State Equation took 5510 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2024-06-01 16:42:58] [INFO ] Invariant cache hit.
[2024-06-01 16:42:58] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-06-01 16:43:20] [INFO ] Deduced a trap composed of 192 places in 932 ms of which 90 ms to minimize.
[2024-06-01 16:43:21] [INFO ] Deduced a trap composed of 108 places in 626 ms of which 10 ms to minimize.
[2024-06-01 16:43:22] [INFO ] Deduced a trap composed of 142 places in 619 ms of which 9 ms to minimize.
[2024-06-01 16:43:23] [INFO ] Deduced a trap composed of 163 places in 472 ms of which 7 ms to minimize.
[2024-06-01 16:43:23] [INFO ] Deduced a trap composed of 290 places in 516 ms of which 7 ms to minimize.
[2024-06-01 16:43:24] [INFO ] Deduced a trap composed of 196 places in 544 ms of which 7 ms to minimize.
[2024-06-01 16:43:24] [INFO ] Deduced a trap composed of 199 places in 508 ms of which 10 ms to minimize.
(s212 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 (/ 10.0 11.0))
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 (/ 1.0 11.0))
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 (/ 9.0 11.0))
(s174 (/ 2.0 11.0))
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 1.0 11.0))
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 (/ 10.0 11.0))
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 (/ 1.0 11.0))
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 1.0 11.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1355 variables, and 30 constraints, problems are : Problem set: 0 solved, 815 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 815/815 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1355 variables, and 30 constraints, problems are : Problem set: 0 solved, 815 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/815 constraints, Known Traps: 7/7 constraints]
After SMT, in 61459ms problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 61535ms
Starting structural reductions in LTL mode, iteration 1 : 529/537 places, 826/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67124 ms. Remains : 529/537 places, 826/914 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 766 ms.
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 37 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-00 finished in 68961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(p1)))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 530 transition count 847
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 530 transition count 847
Applied a total of 14 rules in 70 ms. Remains 530 /537 variables (removed 7) and now considering 847/914 (removed 67) transitions.
// Phase 1: matrix 847 rows 530 cols
[2024-06-01 16:44:01] [INFO ] Computed 24 invariants in 12 ms
[2024-06-01 16:44:02] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-06-01 16:44:02] [INFO ] Invariant cache hit.
[2024-06-01 16:44:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:44:07] [INFO ] Implicit Places using invariants and state equation in 5132 ms returned []
Implicit Place search using SMT with State Equation took 6038 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2024-06-01 16:44:07] [INFO ] Invariant cache hit.
[2024-06-01 16:44:07] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
[2024-06-01 16:44:24] [INFO ] Deduced a trap composed of 148 places in 699 ms of which 9 ms to minimize.
[2024-06-01 16:44:28] [INFO ] Deduced a trap composed of 173 places in 657 ms of which 9 ms to minimize.
[2024-06-01 16:44:29] [INFO ] Deduced a trap composed of 234 places in 741 ms of which 9 ms to minimize.
[2024-06-01 16:44:30] [INFO ] Deduced a trap composed of 201 places in 715 ms of which 9 ms to minimize.
[2024-06-01 16:44:31] [INFO ] Deduced a trap composed of 251 places in 689 ms of which 8 ms to minimize.
[2024-06-01 16:44:31] [INFO ] Deduced a trap composed of 198 places in 682 ms of which 8 ms to minimize.
[2024-06-01 16:44:32] [INFO ] Deduced a trap composed of 287 places in 705 ms of which 8 ms to minimize.
[2024-06-01 16:44:33] [INFO ] Deduced a trap composed of 340 places in 723 ms of which 8 ms to minimize.
[2024-06-01 16:44:34] [INFO ] Deduced a trap composed of 208 places in 710 ms of which 9 ms to minimize.
[2024-06-01 16:44:34] [INFO ] Deduced a trap composed of 138 places in 665 ms of which 8 ms to minimize.
[2024-06-01 16:44:35] [INFO ] Deduced a trap composed of 287 places in 659 ms of which 8 ms to minimize.
[2024-06-01 16:44:36] [INFO ] Deduced a trap composed of 195 places in 545 ms of which 8 ms to minimize.
[2024-06-01 16:44:36] [INFO ] Deduced a trap composed of 252 places in 689 ms of which 8 ms to minimize.
[2024-06-01 16:44:37] [INFO ] Deduced a trap composed of 288 places in 668 ms of which 9 ms to minimize.
[2024-06-01 16:44:38] [INFO ] Deduced a trap composed of 213 places in 522 ms of which 5 ms to minimize.
[2024-06-01 16:44:38] [INFO ] Deduced a trap composed of 148 places in 433 ms of which 6 ms to minimize.
[2024-06-01 16:44:38] [INFO ] Deduced a trap composed of 166 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 31070ms, After SMT, problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 31086ms
Starting structural reductions in LTL mode, iteration 1 : 530/537 places, 847/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37197 ms. Remains : 530/537 places, 847/914 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-03
Product exploration explored 100000 steps with 8 reset in 644 ms.
Stack based approach found an accepted trace after 85 steps with 0 reset with depth 86 and stack size 86 in 2 ms.
FORMULA Anderson-PT-11-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-03 finished in 38260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 528 transition count 825
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 528 transition count 825
Applied a total of 18 rules in 48 ms. Remains 528 /537 variables (removed 9) and now considering 825/914 (removed 89) transitions.
// Phase 1: matrix 825 rows 528 cols
[2024-06-01 16:44:40] [INFO ] Computed 24 invariants in 15 ms
[2024-06-01 16:44:40] [INFO ] Implicit Places using invariants in 893 ms returned []
[2024-06-01 16:44:40] [INFO ] Invariant cache hit.
[2024-06-01 16:44:41] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:44:46] [INFO ] Implicit Places using invariants and state equation in 5115 ms returned []
Implicit Place search using SMT with State Equation took 6014 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2024-06-01 16:44:46] [INFO ] Invariant cache hit.
[2024-06-01 16:44:46] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-06-01 16:45:07] [INFO ] Deduced a trap composed of 144 places in 644 ms of which 7 ms to minimize.
[2024-06-01 16:45:08] [INFO ] Deduced a trap composed of 136 places in 645 ms of which 8 ms to minimize.
[2024-06-01 16:45:09] [INFO ] Deduced a trap composed of 232 places in 467 ms of which 8 ms to minimize.
[2024-06-01 16:45:09] [INFO ] Deduced a trap composed of 336 places in 681 ms of which 8 ms to minimize.
[2024-06-01 16:45:10] [INFO ] Deduced a trap composed of 247 places in 706 ms of which 8 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 251 places in 704 ms of which 9 ms to minimize.
[2024-06-01 16:45:11] [INFO ] Deduced a trap composed of 286 places in 675 ms of which 8 ms to minimize.
[2024-06-01 16:45:12] [INFO ] Deduced a trap composed of 130 places in 671 ms of which 8 ms to minimize.
[2024-06-01 16:45:13] [INFO ] Deduced a trap composed of 113 places in 643 ms of which 9 ms to minimize.
[2024-06-01 16:45:14] [INFO ] Deduced a trap composed of 185 places in 646 ms of which 8 ms to minimize.
[2024-06-01 16:45:14] [INFO ] Deduced a trap composed of 119 places in 626 ms of which 10 ms to minimize.
[2024-06-01 16:45:15] [INFO ] Deduced a trap composed of 275 places in 690 ms of which 8 ms to minimize.
[2024-06-01 16:45:16] [INFO ] Deduced a trap composed of 229 places in 702 ms of which 8 ms to minimize.
[2024-06-01 16:45:17] [INFO ] Deduced a trap composed of 245 places in 685 ms of which 8 ms to minimize.
SMT process timed out in 30980ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 30991ms
Starting structural reductions in LTL mode, iteration 1 : 528/537 places, 825/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37055 ms. Remains : 528/537 places, 825/914 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-05 finished in 38150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 417 transition count 794
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 240 place count 417 transition count 685
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 458 place count 308 transition count 685
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 466 place count 300 transition count 617
Iterating global reduction 2 with 8 rules applied. Total rules applied 474 place count 300 transition count 617
Applied a total of 474 rules in 96 ms. Remains 300 /537 variables (removed 237) and now considering 617/914 (removed 297) transitions.
// Phase 1: matrix 617 rows 300 cols
[2024-06-01 16:45:18] [INFO ] Computed 24 invariants in 10 ms
[2024-06-01 16:45:18] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-01 16:45:18] [INFO ] Invariant cache hit.
[2024-06-01 16:45:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:45:20] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2553 ms to find 0 implicit places.
[2024-06-01 16:45:20] [INFO ] Redundant transitions in 68 ms returned []
Running 606 sub problems to find dead transitions.
[2024-06-01 16:45:20] [INFO ] Invariant cache hit.
[2024-06-01 16:45:20] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-01 16:45:30] [INFO ] Deduced a trap composed of 105 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:45:34] [INFO ] Deduced a trap composed of 113 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:45:35] [INFO ] Deduced a trap composed of 127 places in 424 ms of which 5 ms to minimize.
[2024-06-01 16:45:35] [INFO ] Deduced a trap composed of 68 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:45:36] [INFO ] Deduced a trap composed of 92 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:45:36] [INFO ] Deduced a trap composed of 94 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:45:37] [INFO ] Deduced a trap composed of 72 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:45:37] [INFO ] Deduced a trap composed of 137 places in 438 ms of which 5 ms to minimize.
[2024-06-01 16:45:37] [INFO ] Deduced a trap composed of 120 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 118 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:45:38] [INFO ] Deduced a trap composed of 128 places in 416 ms of which 6 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 100 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:45:39] [INFO ] Deduced a trap composed of 125 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 124 places in 426 ms of which 5 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 90 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:45:40] [INFO ] Deduced a trap composed of 132 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 114 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:45:41] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 111 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:45:42] [INFO ] Deduced a trap composed of 112 places in 337 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-01 16:45:44] [INFO ] Deduced a trap composed of 113 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 94 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:45:47] [INFO ] Deduced a trap composed of 132 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 90 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 80 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:45:48] [INFO ] Deduced a trap composed of 61 places in 440 ms of which 6 ms to minimize.
[2024-06-01 16:45:49] [INFO ] Deduced a trap composed of 128 places in 419 ms of which 6 ms to minimize.
[2024-06-01 16:45:49] [INFO ] Deduced a trap composed of 112 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:45:50] [INFO ] Deduced a trap composed of 110 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:45:50] [INFO ] Deduced a trap composed of 92 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 118 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 89 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:45:51] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 31055ms, After SMT, problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 31067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 300/537 places, 617/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33798 ms. Remains : 300/537 places, 617/914 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-06
Product exploration explored 100000 steps with 14 reset in 209 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-06 finished in 34169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 537 transition count 815
Reduce places removed 99 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 110 rules applied. Total rules applied 209 place count 438 transition count 804
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 220 place count 427 transition count 804
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 220 place count 427 transition count 694
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 440 place count 317 transition count 694
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 449 place count 308 transition count 605
Iterating global reduction 3 with 9 rules applied. Total rules applied 458 place count 308 transition count 605
Applied a total of 458 rules in 75 ms. Remains 308 /537 variables (removed 229) and now considering 605/914 (removed 309) transitions.
// Phase 1: matrix 605 rows 308 cols
[2024-06-01 16:45:52] [INFO ] Computed 24 invariants in 5 ms
[2024-06-01 16:45:52] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-06-01 16:45:52] [INFO ] Invariant cache hit.
[2024-06-01 16:45:53] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:45:54] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2024-06-01 16:45:54] [INFO ] Redundant transitions in 7 ms returned []
Running 594 sub problems to find dead transitions.
[2024-06-01 16:45:54] [INFO ] Invariant cache hit.
[2024-06-01 16:45:54] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-06-01 16:46:05] [INFO ] Deduced a trap composed of 127 places in 413 ms of which 6 ms to minimize.
[2024-06-01 16:46:06] [INFO ] Deduced a trap composed of 91 places in 447 ms of which 5 ms to minimize.
[2024-06-01 16:46:06] [INFO ] Deduced a trap composed of 106 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 114 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:46:07] [INFO ] Deduced a trap composed of 79 places in 423 ms of which 6 ms to minimize.
[2024-06-01 16:46:08] [INFO ] Deduced a trap composed of 140 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:46:09] [INFO ] Deduced a trap composed of 115 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:46:09] [INFO ] Deduced a trap composed of 93 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:46:10] [INFO ] Deduced a trap composed of 91 places in 417 ms of which 6 ms to minimize.
[2024-06-01 16:46:10] [INFO ] Deduced a trap composed of 127 places in 432 ms of which 5 ms to minimize.
[2024-06-01 16:46:10] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:46:11] [INFO ] Deduced a trap composed of 130 places in 407 ms of which 6 ms to minimize.
[2024-06-01 16:46:11] [INFO ] Deduced a trap composed of 118 places in 397 ms of which 4 ms to minimize.
[2024-06-01 16:46:12] [INFO ] Deduced a trap composed of 85 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:46:13] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 6 ms to minimize.
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 123 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 107 places in 431 ms of which 5 ms to minimize.
[2024-06-01 16:46:15] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:46:16] [INFO ] Deduced a trap composed of 123 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:46:16] [INFO ] Deduced a trap composed of 106 places in 401 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-06-01 16:46:21] [INFO ] Deduced a trap composed of 69 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:46:22] [INFO ] Deduced a trap composed of 105 places in 430 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/913 variables, and 45 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/308 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 594/594 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/913 variables, and 45 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/308 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/594 constraints, Known Traps: 22/22 constraints]
After SMT, in 60525ms problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/537 places, 605/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62993 ms. Remains : 308/537 places, 605/914 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-10
Product exploration explored 100000 steps with 1901 reset in 355 ms.
Stack based approach found an accepted trace after 258 steps with 4 reset with depth 47 and stack size 47 in 2 ms.
FORMULA Anderson-PT-11-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-10 finished in 63495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 417 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 416 transition count 793
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 242 place count 416 transition count 684
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 460 place count 307 transition count 684
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 468 place count 299 transition count 596
Iterating global reduction 3 with 8 rules applied. Total rules applied 476 place count 299 transition count 596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 478 place count 298 transition count 595
Applied a total of 478 rules in 91 ms. Remains 298 /537 variables (removed 239) and now considering 595/914 (removed 319) transitions.
// Phase 1: matrix 595 rows 298 cols
[2024-06-01 16:46:55] [INFO ] Computed 24 invariants in 11 ms
[2024-06-01 16:46:56] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-06-01 16:46:56] [INFO ] Invariant cache hit.
[2024-06-01 16:46:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:46:58] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2024-06-01 16:46:58] [INFO ] Redundant transitions in 6 ms returned []
Running 584 sub problems to find dead transitions.
[2024-06-01 16:46:58] [INFO ] Invariant cache hit.
[2024-06-01 16:46:58] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:47:07] [INFO ] Deduced a trap composed of 138 places in 356 ms of which 5 ms to minimize.
[2024-06-01 16:47:07] [INFO ] Deduced a trap composed of 121 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:47:07] [INFO ] Deduced a trap composed of 85 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 98 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:47:08] [INFO ] Deduced a trap composed of 91 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 104 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 105 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:47:09] [INFO ] Deduced a trap composed of 107 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 92 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:47:10] [INFO ] Deduced a trap composed of 79 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:47:11] [INFO ] Deduced a trap composed of 73 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 100 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:47:12] [INFO ] Deduced a trap composed of 71 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 87 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 81 places in 388 ms of which 6 ms to minimize.
[2024-06-01 16:47:13] [INFO ] Deduced a trap composed of 73 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:47:14] [INFO ] Deduced a trap composed of 77 places in 393 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 116 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:47:20] [INFO ] Deduced a trap composed of 92 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 106 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:47:21] [INFO ] Deduced a trap composed of 104 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 73 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:47:22] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 73 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 71 places in 328 ms of which 3 ms to minimize.
[2024-06-01 16:47:23] [INFO ] Deduced a trap composed of 90 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 93 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:47:24] [INFO ] Deduced a trap composed of 85 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 86 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 80 places in 399 ms of which 6 ms to minimize.
[2024-06-01 16:47:25] [INFO ] Deduced a trap composed of 94 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 5 ms to minimize.
[2024-06-01 16:47:26] [INFO ] Deduced a trap composed of 95 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 80 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:47:27] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:47:28] [INFO ] Deduced a trap composed of 96 places in 396 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 40/40 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/537 places, 595/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63730 ms. Remains : 298/537 places, 595/914 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 43 reset in 190 ms.
Product exploration explored 100000 steps with 53 reset in 511 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5211 steps (0 resets) in 56 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 17 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 16:48:00] [INFO ] Invariant cache hit.
[2024-06-01 16:48:01] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 16:48:01] [INFO ] Invariant cache hit.
[2024-06-01 16:48:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:48:03] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2024-06-01 16:48:03] [INFO ] Redundant transitions in 6 ms returned []
Running 584 sub problems to find dead transitions.
[2024-06-01 16:48:03] [INFO ] Invariant cache hit.
[2024-06-01 16:48:03] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 138 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 121 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 85 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 98 places in 396 ms of which 6 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 91 places in 400 ms of which 6 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 104 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 130 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 105 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Deduced a trap composed of 107 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 92 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 79 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:48:18] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 83 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:48:19] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 100 places in 393 ms of which 5 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 71 places in 407 ms of which 4 ms to minimize.
[2024-06-01 16:48:20] [INFO ] Deduced a trap composed of 87 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:48:21] [INFO ] Deduced a trap composed of 77 places in 376 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:48:27] [INFO ] Deduced a trap composed of 116 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 92 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 3 ms to minimize.
[2024-06-01 16:48:28] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 104 places in 362 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 73 places in 395 ms of which 4 ms to minimize.
[2024-06-01 16:48:29] [INFO ] Deduced a trap composed of 104 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 73 places in 423 ms of which 6 ms to minimize.
[2024-06-01 16:48:30] [INFO ] Deduced a trap composed of 71 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 90 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 93 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:48:31] [INFO ] Deduced a trap composed of 85 places in 307 ms of which 3 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 80 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:48:32] [INFO ] Deduced a trap composed of 94 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 88 places in 281 ms of which 3 ms to minimize.
[2024-06-01 16:48:33] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 97 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:48:34] [INFO ] Deduced a trap composed of 96 places in 245 ms of which 5 ms to minimize.
SMT process timed out in 30920ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 30932ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33595 ms. Remains : 298/298 places, 595/595 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 723 steps (0 resets) in 13 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 62 reset in 322 ms.
Product exploration explored 100000 steps with 49 reset in 347 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 26 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 16:48:35] [INFO ] Invariant cache hit.
[2024-06-01 16:48:36] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 16:48:36] [INFO ] Invariant cache hit.
[2024-06-01 16:48:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:48:38] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2436 ms to find 0 implicit places.
[2024-06-01 16:48:38] [INFO ] Redundant transitions in 7 ms returned []
Running 584 sub problems to find dead transitions.
[2024-06-01 16:48:38] [INFO ] Invariant cache hit.
[2024-06-01 16:48:38] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:48:49] [INFO ] Deduced a trap composed of 138 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:48:49] [INFO ] Deduced a trap composed of 121 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:48:50] [INFO ] Deduced a trap composed of 85 places in 353 ms of which 5 ms to minimize.
[2024-06-01 16:48:50] [INFO ] Deduced a trap composed of 98 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:48:50] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:48:51] [INFO ] Deduced a trap composed of 104 places in 426 ms of which 5 ms to minimize.
[2024-06-01 16:48:51] [INFO ] Deduced a trap composed of 130 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 105 places in 410 ms of which 6 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 107 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:48:52] [INFO ] Deduced a trap composed of 92 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 79 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:48:53] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 6 ms to minimize.
[2024-06-01 16:48:54] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 100 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 71 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:48:55] [INFO ] Deduced a trap composed of 87 places in 447 ms of which 5 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:48:57] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:49:02] [INFO ] Deduced a trap composed of 116 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 92 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:49:03] [INFO ] Deduced a trap composed of 106 places in 424 ms of which 5 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 75 places in 426 ms of which 5 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 104 places in 429 ms of which 5 ms to minimize.
[2024-06-01 16:49:04] [INFO ] Deduced a trap composed of 73 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 104 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:49:05] [INFO ] Deduced a trap composed of 73 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 90 places in 411 ms of which 6 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 93 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 85 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 86 places in 433 ms of which 7 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 80 places in 378 ms of which 5 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 94 places in 435 ms of which 5 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 88 places in 443 ms of which 5 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 95 places in 435 ms of which 5 ms to minimize.
SMT process timed out in 31108ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 31120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33597 ms. Remains : 298/298 places, 595/595 transitions.
Treatment of property Anderson-PT-11-LTLCardinality-12 finished in 133878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 417 transition count 794
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 240 place count 417 transition count 685
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 458 place count 308 transition count 685
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 466 place count 300 transition count 617
Iterating global reduction 2 with 8 rules applied. Total rules applied 474 place count 300 transition count 617
Applied a total of 474 rules in 77 ms. Remains 300 /537 variables (removed 237) and now considering 617/914 (removed 297) transitions.
// Phase 1: matrix 617 rows 300 cols
[2024-06-01 16:49:09] [INFO ] Computed 24 invariants in 13 ms
[2024-06-01 16:49:10] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-06-01 16:49:10] [INFO ] Invariant cache hit.
[2024-06-01 16:49:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:49:12] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2702 ms to find 0 implicit places.
[2024-06-01 16:49:12] [INFO ] Redundant transitions in 7 ms returned []
Running 606 sub problems to find dead transitions.
[2024-06-01 16:49:12] [INFO ] Invariant cache hit.
[2024-06-01 16:49:12] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 69 places in 429 ms of which 5 ms to minimize.
[2024-06-01 16:49:24] [INFO ] Deduced a trap composed of 148 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Deduced a trap composed of 138 places in 370 ms of which 5 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Deduced a trap composed of 111 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:49:25] [INFO ] Deduced a trap composed of 101 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:49:26] [INFO ] Deduced a trap composed of 108 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:49:26] [INFO ] Deduced a trap composed of 102 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 90 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 83 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:49:27] [INFO ] Deduced a trap composed of 113 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:49:28] [INFO ] Deduced a trap composed of 130 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:49:28] [INFO ] Deduced a trap composed of 97 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:49:28] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:49:28] [INFO ] Deduced a trap composed of 106 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 119 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 82 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 68 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 94 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 139 places in 332 ms of which 5 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 106 places in 322 ms of which 3 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 107 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 107 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 108 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 110 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 95 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 107 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:49:36] [INFO ] Deduced a trap composed of 113 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:49:37] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:49:37] [INFO ] Deduced a trap composed of 104 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:49:38] [INFO ] Deduced a trap composed of 88 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:49:38] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:49:38] [INFO ] Deduced a trap composed of 63 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:49:39] [INFO ] Deduced a trap composed of 91 places in 228 ms of which 3 ms to minimize.
[2024-06-01 16:49:39] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:49:39] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:49:39] [INFO ] Deduced a trap composed of 101 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/917 variables, and 64 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/300 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 80 places in 436 ms of which 5 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 106 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 85 places in 435 ms of which 5 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 83 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 83 places in 424 ms of which 6 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 87 places in 426 ms of which 7 ms to minimize.
[2024-06-01 16:49:54] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 5 ms to minimize.
[2024-06-01 16:49:55] [INFO ] Deduced a trap composed of 82 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:49:55] [INFO ] Deduced a trap composed of 72 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:49:56] [INFO ] Deduced a trap composed of 104 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:49:56] [INFO ] Deduced a trap composed of 78 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:49:57] [INFO ] Deduced a trap composed of 119 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:49:58] [INFO ] Deduced a trap composed of 98 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:49:58] [INFO ] Deduced a trap composed of 106 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:49:59] [INFO ] Deduced a trap composed of 134 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:49:59] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:50:00] [INFO ] Deduced a trap composed of 97 places in 410 ms of which 6 ms to minimize.
[2024-06-01 16:50:00] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:50:00] [INFO ] Deduced a trap composed of 97 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:50:01] [INFO ] Deduced a trap composed of 84 places in 413 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/917 variables, and 84 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/300 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/606 constraints, Known Traps: 60/60 constraints]
After SMT, in 60846ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 300/537 places, 617/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63654 ms. Remains : 300/537 places, 617/914 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 229 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-13 finished in 64066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 417 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 416 transition count 793
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 242 place count 416 transition count 684
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 460 place count 307 transition count 684
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 469 place count 298 transition count 595
Iterating global reduction 3 with 9 rules applied. Total rules applied 478 place count 298 transition count 595
Applied a total of 478 rules in 33 ms. Remains 298 /537 variables (removed 239) and now considering 595/914 (removed 319) transitions.
// Phase 1: matrix 595 rows 298 cols
[2024-06-01 16:50:13] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 16:50:14] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-06-01 16:50:14] [INFO ] Invariant cache hit.
[2024-06-01 16:50:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:50:17] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3312 ms to find 0 implicit places.
[2024-06-01 16:50:17] [INFO ] Redundant transitions in 7 ms returned []
Running 584 sub problems to find dead transitions.
[2024-06-01 16:50:17] [INFO ] Invariant cache hit.
[2024-06-01 16:50:17] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 154 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 92 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:50:29] [INFO ] Deduced a trap composed of 118 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:50:29] [INFO ] Deduced a trap composed of 129 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:50:30] [INFO ] Deduced a trap composed of 111 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:50:30] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 105 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:50:31] [INFO ] Deduced a trap composed of 106 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 94 places in 331 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 97 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 101 places in 307 ms of which 5 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 92 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:50:34] [INFO ] Deduced a trap composed of 83 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:50:34] [INFO ] Deduced a trap composed of 109 places in 420 ms of which 7 ms to minimize.
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 82 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 119 places in 405 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-01 16:50:41] [INFO ] Deduced a trap composed of 112 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:50:42] [INFO ] Deduced a trap composed of 110 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 89 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:50:43] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 5 ms to minimize.
[2024-06-01 16:50:44] [INFO ] Deduced a trap composed of 90 places in 393 ms of which 6 ms to minimize.
[2024-06-01 16:50:44] [INFO ] Deduced a trap composed of 88 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 82 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 113 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 110 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:50:46] [INFO ] Deduced a trap composed of 100 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:50:46] [INFO ] Deduced a trap composed of 90 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 73 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 98 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:50:48] [INFO ] Deduced a trap composed of 75 places in 400 ms of which 5 ms to minimize.
SMT process timed out in 30918ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 30928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/537 places, 595/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34290 ms. Remains : 298/537 places, 595/914 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 314 ms.
Stack based approach found an accepted trace after 3262 steps with 0 reset with depth 3263 and stack size 225 in 33 ms.
FORMULA Anderson-PT-11-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-14 finished in 34711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 537 transition count 795
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 418 transition count 795
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 238 place count 418 transition count 687
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 454 place count 310 transition count 687
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 460 place count 304 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 466 place count 304 transition count 621
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 470 place count 302 transition count 619
Applied a total of 470 rules in 62 ms. Remains 302 /537 variables (removed 235) and now considering 619/914 (removed 295) transitions.
// Phase 1: matrix 619 rows 302 cols
[2024-06-01 16:50:48] [INFO ] Computed 24 invariants in 7 ms
[2024-06-01 16:50:49] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-01 16:50:49] [INFO ] Invariant cache hit.
[2024-06-01 16:50:49] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:50:51] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
[2024-06-01 16:50:51] [INFO ] Redundant transitions in 4 ms returned []
Running 608 sub problems to find dead transitions.
[2024-06-01 16:50:51] [INFO ] Invariant cache hit.
[2024-06-01 16:50:51] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:51:00] [INFO ] Deduced a trap composed of 105 places in 443 ms of which 6 ms to minimize.
[2024-06-01 16:51:00] [INFO ] Deduced a trap composed of 109 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 107 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 3 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 5 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 96 places in 368 ms of which 4 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 77 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 104 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 84 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 116 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 100 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 138 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 72 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 116 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 112 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 96 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 94 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 84 places in 419 ms of which 5 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 71 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 84 places in 419 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 105 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 92 places in 397 ms of which 5 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 74 places in 369 ms of which 6 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 81 places in 379 ms of which 9 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 80 places in 379 ms of which 6 ms to minimize.
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 109 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 76 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 102 places in 381 ms of which 6 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 83 places in 378 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 80 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 114 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 113 places in 405 ms of which 5 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 113 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 103 places in 408 ms of which 6 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 97 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 116 places in 387 ms of which 5 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 91 places in 378 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/921 variables, and 63 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/302 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:51:25] [INFO ] Deduced a trap composed of 96 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:51:25] [INFO ] Deduced a trap composed of 120 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 92 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 73 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 92 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 90 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 119 places in 397 ms of which 4 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 99 places in 427 ms of which 5 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 120 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 97 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 90 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:51:29] [INFO ] Deduced a trap composed of 125 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 124 places in 448 ms of which 5 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 78 places in 400 ms of which 6 ms to minimize.
[2024-06-01 16:51:31] [INFO ] Deduced a trap composed of 98 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:51:31] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:51:31] [INFO ] Deduced a trap composed of 95 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:51:32] [INFO ] Deduced a trap composed of 118 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:51:32] [INFO ] Deduced a trap composed of 107 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:51:33] [INFO ] Deduced a trap composed of 111 places in 324 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:51:35] [INFO ] Deduced a trap composed of 122 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:51:36] [INFO ] Deduced a trap composed of 95 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:51:36] [INFO ] Deduced a trap composed of 131 places in 371 ms of which 4 ms to minimize.
[2024-06-01 16:51:37] [INFO ] Deduced a trap composed of 84 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:51:37] [INFO ] Deduced a trap composed of 121 places in 365 ms of which 3 ms to minimize.
[2024-06-01 16:51:37] [INFO ] Deduced a trap composed of 83 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:51:38] [INFO ] Deduced a trap composed of 114 places in 254 ms of which 5 ms to minimize.
[2024-06-01 16:51:38] [INFO ] Deduced a trap composed of 76 places in 424 ms of which 5 ms to minimize.
[2024-06-01 16:51:38] [INFO ] Deduced a trap composed of 103 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:51:39] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:51:39] [INFO ] Deduced a trap composed of 124 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 61 places in 372 ms of which 7 ms to minimize.
[2024-06-01 16:51:40] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 63 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 65 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:51:41] [INFO ] Deduced a trap composed of 116 places in 368 ms of which 6 ms to minimize.
[2024-06-01 16:51:42] [INFO ] Deduced a trap composed of 95 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 102 places in 382 ms of which 5 ms to minimize.
[2024-06-01 16:51:45] [INFO ] Deduced a trap composed of 109 places in 428 ms of which 5 ms to minimize.
[2024-06-01 16:51:46] [INFO ] Deduced a trap composed of 137 places in 428 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:51:49] [INFO ] Deduced a trap composed of 102 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:51:50] [INFO ] Deduced a trap composed of 106 places in 417 ms of which 5 ms to minimize.
[2024-06-01 16:51:50] [INFO ] Deduced a trap composed of 116 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:51:51] [INFO ] Deduced a trap composed of 100 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:51:51] [INFO ] Deduced a trap composed of 103 places in 445 ms of which 5 ms to minimize.
[2024-06-01 16:51:51] [INFO ] Deduced a trap composed of 100 places in 416 ms of which 5 ms to minimize.
SMT process timed out in 60809ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 302/537 places, 619/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63444 ms. Remains : 302/537 places, 619/914 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 403 ms.
Product exploration explored 100000 steps with 0 reset in 454 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 596 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 455 ms. (87 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
[2024-06-01 16:51:54] [INFO ] Invariant cache hit.
[2024-06-01 16:51:54] [INFO ] State equation strengthened by 110 read => feed constraints.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/921 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/302 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 1240 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p2) (NOT p1))]
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 619/619 transitions.
Applied a total of 0 rules in 21 ms. Remains 302 /302 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-01 16:51:55] [INFO ] Invariant cache hit.
[2024-06-01 16:51:56] [INFO ] Implicit Places using invariants in 771 ms returned []
[2024-06-01 16:51:56] [INFO ] Invariant cache hit.
[2024-06-01 16:51:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:51:58] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2024-06-01 16:51:58] [INFO ] Redundant transitions in 7 ms returned []
Running 608 sub problems to find dead transitions.
[2024-06-01 16:51:58] [INFO ] Invariant cache hit.
[2024-06-01 16:51:58] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:52:07] [INFO ] Deduced a trap composed of 105 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 109 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:52:11] [INFO ] Deduced a trap composed of 107 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:52:11] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:52:11] [INFO ] Deduced a trap composed of 84 places in 424 ms of which 5 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 96 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 77 places in 374 ms of which 4 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 84 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 116 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 100 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 138 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 116 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 112 places in 430 ms of which 6 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 96 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 94 places in 407 ms of which 5 ms to minimize.
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 84 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 71 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:52:18] [INFO ] Deduced a trap composed of 84 places in 383 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:52:19] [INFO ] Deduced a trap composed of 105 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 92 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:52:20] [INFO ] Deduced a trap composed of 74 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:52:21] [INFO ] Deduced a trap composed of 97 places in 486 ms of which 5 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 80 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 109 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:52:22] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 102 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:52:23] [INFO ] Deduced a trap composed of 83 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:52:24] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 113 places in 413 ms of which 5 ms to minimize.
[2024-06-01 16:52:25] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 103 places in 393 ms of which 6 ms to minimize.
[2024-06-01 16:52:26] [INFO ] Deduced a trap composed of 97 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 116 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 5 ms to minimize.
[2024-06-01 16:52:27] [INFO ] Deduced a trap composed of 90 places in 420 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/921 variables, and 64 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/302 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 40/64 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 107 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 137 places in 433 ms of which 5 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 142 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 115 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 6 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 79 places in 420 ms of which 6 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 76 places in 423 ms of which 5 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 83 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 83 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 71 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 77 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 62 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 61 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 60 places in 382 ms of which 5 ms to minimize.
[2024-06-01 16:52:44] [INFO ] Deduced a trap composed of 66 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:52:44] [INFO ] Deduced a trap composed of 86 places in 418 ms of which 4 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 76 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 88 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 66 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:52:46] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:52:49] [INFO ] Deduced a trap composed of 96 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:52:50] [INFO ] Deduced a trap composed of 110 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:52:50] [INFO ] Deduced a trap composed of 106 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:52:50] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 6 ms to minimize.
[2024-06-01 16:52:51] [INFO ] Deduced a trap composed of 69 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:52:51] [INFO ] Deduced a trap composed of 89 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:52:52] [INFO ] Deduced a trap composed of 83 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:52:52] [INFO ] Deduced a trap composed of 112 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:52:53] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:52:53] [INFO ] Deduced a trap composed of 116 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:52:53] [INFO ] Deduced a trap composed of 101 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 84 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 73 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:52:54] [INFO ] Deduced a trap composed of 82 places in 403 ms of which 4 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:52:55] [INFO ] Deduced a trap composed of 105 places in 400 ms of which 5 ms to minimize.
[2024-06-01 16:52:56] [INFO ] Deduced a trap composed of 90 places in 425 ms of which 5 ms to minimize.
[2024-06-01 16:52:56] [INFO ] Deduced a trap composed of 68 places in 421 ms of which 5 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 81 places in 422 ms of which 5 ms to minimize.
[2024-06-01 16:52:57] [INFO ] Deduced a trap composed of 97 places in 408 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/921 variables, and 104 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/302 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/608 constraints, Known Traps: 80/80 constraints]
After SMT, in 60934ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63979 ms. Remains : 302/302 places, 619/619 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/3 properties
BEST_FIRST walk for 3625 steps (0 resets) in 11 ms. (302 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 406 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 619/619 transitions.
Applied a total of 0 rules in 18 ms. Remains 302 /302 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-01 16:53:01] [INFO ] Invariant cache hit.
[2024-06-01 16:53:01] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-06-01 16:53:01] [INFO ] Invariant cache hit.
[2024-06-01 16:53:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-06-01 16:53:03] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
[2024-06-01 16:53:03] [INFO ] Redundant transitions in 5 ms returned []
Running 608 sub problems to find dead transitions.
[2024-06-01 16:53:03] [INFO ] Invariant cache hit.
[2024-06-01 16:53:03] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 105 places in 402 ms of which 6 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 109 places in 420 ms of which 5 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 107 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 89 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 84 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 96 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 77 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 104 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 84 places in 441 ms of which 5 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 116 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 100 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 138 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 5 ms to minimize.
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 116 places in 411 ms of which 5 ms to minimize.
[2024-06-01 16:53:23] [INFO ] Deduced a trap composed of 112 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:53:23] [INFO ] Deduced a trap composed of 96 places in 437 ms of which 5 ms to minimize.
[2024-06-01 16:53:24] [INFO ] Deduced a trap composed of 94 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:53:24] [INFO ] Deduced a trap composed of 84 places in 418 ms of which 5 ms to minimize.
[2024-06-01 16:53:25] [INFO ] Deduced a trap composed of 71 places in 412 ms of which 5 ms to minimize.
[2024-06-01 16:53:25] [INFO ] Deduced a trap composed of 84 places in 411 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-06-01 16:53:27] [INFO ] Deduced a trap composed of 105 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:53:27] [INFO ] Deduced a trap composed of 92 places in 390 ms of which 5 ms to minimize.
[2024-06-01 16:53:27] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:53:28] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:53:28] [INFO ] Deduced a trap composed of 97 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:53:29] [INFO ] Deduced a trap composed of 80 places in 399 ms of which 5 ms to minimize.
[2024-06-01 16:53:29] [INFO ] Deduced a trap composed of 109 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:53:29] [INFO ] Deduced a trap composed of 76 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 102 places in 368 ms of which 5 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 83 places in 378 ms of which 5 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 80 places in 401 ms of which 5 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 114 places in 409 ms of which 5 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 113 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 103 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 97 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 116 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 91 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 90 places in 377 ms of which 5 ms to minimize.
SMT process timed out in 31012ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 31023ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33569 ms. Remains : 302/302 places, 619/619 transitions.
Treatment of property Anderson-PT-11-LTLCardinality-15 finished in 166432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
[2024-06-01 16:53:35] [INFO ] Flatten gal took : 98 ms
[2024-06-01 16:53:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 16:53:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 914 transitions and 3184 arcs took 16 ms.
Total runtime 647544 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Anderson-PT-11-LTLCardinality-12
Could not compute solution for formula : Anderson-PT-11-LTLCardinality-15
BK_STOP 1717261127243
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-11-LTLCardinality-12
ltl formula formula --ltl=/tmp/2595/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 537 places, 914 transitions and 3184 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2595/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2595/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2595/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2595/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 539 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 538, there are 923 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2205 levels ~10000 states ~27436 transitions
pnml2lts-mc( 2/ 4): ~4387 levels ~20000 states ~57784 transitions
pnml2lts-mc( 2/ 4): ~8790 levels ~40000 states ~112548 transitions
pnml2lts-mc( 2/ 4): ~17429 levels ~80000 states ~236332 transitions
pnml2lts-mc( 2/ 4): ~34415 levels ~160000 states ~472968 transitions
pnml2lts-mc( 2/ 4): ~67260 levels ~320000 states ~942776 transitions
pnml2lts-mc( 0/ 4): ~137110 levels ~640000 states ~1896768 transitions
pnml2lts-mc( 0/ 4): ~276942 levels ~1280000 states ~3782556 transitions
pnml2lts-mc( 0/ 4): ~551342 levels ~2560000 states ~7463668 transitions
pnml2lts-mc( 0/ 4): ~1096362 levels ~5120000 states ~14726800 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 41311
pnml2lts-mc( 0/ 4): unique states count: 5720505
pnml2lts-mc( 0/ 4): unique transitions count: 17138863
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 61513
pnml2lts-mc( 0/ 4): - claim found count: 6915753
pnml2lts-mc( 0/ 4): - claim success count: 5720508
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4884518
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5720508 states 17138895 transitions, fanout: 2.996
pnml2lts-mc( 0/ 4): Total exploration time 151.100 sec (151.070 sec minimum, 151.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37859, Transitions per second: 113428
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 136.0MB, 15.1 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 928 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 136.0MB (~256.0MB paged-in)
ltl formula name Anderson-PT-11-LTLCardinality-15
ltl formula formula --ltl=/tmp/2595/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 537 places, 914 transitions and 3184 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.060 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2595/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2595/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2595/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2595/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 538 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 538, there are 954 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2183 levels ~10000 states ~53732 transitions
pnml2lts-mc( 0/ 4): ~4167 levels ~20000 states ~121236 transitions
pnml2lts-mc( 0/ 4): ~8272 levels ~40000 states ~238476 transitions
pnml2lts-mc( 0/ 4): ~16631 levels ~80000 states ~465232 transitions
pnml2lts-mc( 0/ 4): ~32916 levels ~160000 states ~941056 transitions
pnml2lts-mc( 1/ 4): ~66562 levels ~320000 states ~1899252 transitions
pnml2lts-mc( 1/ 4): ~134177 levels ~640000 states ~3796996 transitions
pnml2lts-mc( 1/ 4): ~269590 levels ~1280000 states ~7521192 transitions
pnml2lts-mc( 0/ 4): ~530604 levels ~2560000 states ~15600340 transitions
pnml2lts-mc( 1/ 4): ~1089673 levels ~5120000 states ~30921700 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6166624
pnml2lts-mc( 0/ 4): unique transitions count: 37260059
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 17020269
pnml2lts-mc( 0/ 4): - claim success count: 6166627
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5250014
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6166627 states 37260094 transitions, fanout: 6.042
pnml2lts-mc( 0/ 4): Total exploration time 158.480 sec (158.440 sec minimum, 158.455 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38911, Transitions per second: 235109
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 139.1MB, 14.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 928 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 139.1MB (~256.0MB paged-in)
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="Anderson-PT-11"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;