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.r004-smll-171620118400348.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 itstools
Input is Anderson-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K 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.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 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 667K 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-08-LTLFireability-00
FORMULA_NAME Anderson-PT-08-LTLFireability-01
FORMULA_NAME Anderson-PT-08-LTLFireability-02
FORMULA_NAME Anderson-PT-08-LTLFireability-03
FORMULA_NAME Anderson-PT-08-LTLFireability-04
FORMULA_NAME Anderson-PT-08-LTLFireability-05
FORMULA_NAME Anderson-PT-08-LTLFireability-06
FORMULA_NAME Anderson-PT-08-LTLFireability-07
FORMULA_NAME Anderson-PT-08-LTLFireability-08
FORMULA_NAME Anderson-PT-08-LTLFireability-09
FORMULA_NAME Anderson-PT-08-LTLFireability-10
FORMULA_NAME Anderson-PT-08-LTLFireability-11
FORMULA_NAME Anderson-PT-08-LTLFireability-12
FORMULA_NAME Anderson-PT-08-LTLFireability-13
FORMULA_NAME Anderson-PT-08-LTLFireability-14
FORMULA_NAME Anderson-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716433328394

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 03:02:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 03:02:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:02:11] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2024-05-23 03:02:11] [INFO ] Transformed 401 places.
[2024-05-23 03:02:11] [INFO ] Transformed 1328 transitions.
[2024-05-23 03:02:11] [INFO ] Found NUPN structural information;
[2024-05-23 03:02:11] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 738 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 310 transition count 733
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 310 transition count 733
Applied a total of 182 rules in 184 ms. Remains 310 /401 variables (removed 91) and now considering 733/1328 (removed 595) transitions.
// Phase 1: matrix 733 rows 310 cols
[2024-05-23 03:02:12] [INFO ] Computed 19 invariants in 73 ms
[2024-05-23 03:02:13] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2024-05-23 03:02:13] [INFO ] Invariant cache hit.
[2024-05-23 03:02:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:02:16] [INFO ] Implicit Places using invariants and state equation in 2667 ms returned []
Implicit Place search using SMT with State Equation took 3828 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2024-05-23 03:02:16] [INFO ] Invariant cache hit.
[2024-05-23 03:02:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:02:26] [INFO ] Deduced a trap composed of 116 places in 472 ms of which 51 ms to minimize.
[2024-05-23 03:02:27] [INFO ] Deduced a trap composed of 133 places in 351 ms of which 6 ms to minimize.
[2024-05-23 03:02:27] [INFO ] Deduced a trap composed of 122 places in 368 ms of which 6 ms to minimize.
[2024-05-23 03:02:28] [INFO ] Deduced a trap composed of 152 places in 344 ms of which 5 ms to minimize.
[2024-05-23 03:02:28] [INFO ] Deduced a trap composed of 78 places in 288 ms of which 3 ms to minimize.
[2024-05-23 03:02:28] [INFO ] Deduced a trap composed of 105 places in 311 ms of which 5 ms to minimize.
[2024-05-23 03:02:29] [INFO ] Deduced a trap composed of 99 places in 341 ms of which 4 ms to minimize.
[2024-05-23 03:02:29] [INFO ] Deduced a trap composed of 100 places in 277 ms of which 5 ms to minimize.
[2024-05-23 03:02:29] [INFO ] Deduced a trap composed of 137 places in 388 ms of which 5 ms to minimize.
[2024-05-23 03:02:30] [INFO ] Deduced a trap composed of 127 places in 369 ms of which 5 ms to minimize.
[2024-05-23 03:02:31] [INFO ] Deduced a trap composed of 131 places in 432 ms of which 6 ms to minimize.
[2024-05-23 03:02:31] [INFO ] Deduced a trap composed of 177 places in 354 ms of which 4 ms to minimize.
[2024-05-23 03:02:31] [INFO ] Deduced a trap composed of 90 places in 408 ms of which 6 ms to minimize.
[2024-05-23 03:02:32] [INFO ] Deduced a trap composed of 212 places in 450 ms of which 7 ms to minimize.
[2024-05-23 03:02:32] [INFO ] Deduced a trap composed of 204 places in 388 ms of which 4 ms to minimize.
[2024-05-23 03:02:33] [INFO ] Deduced a trap composed of 209 places in 337 ms of which 4 ms to minimize.
[2024-05-23 03:02:33] [INFO ] Deduced a trap composed of 202 places in 338 ms of which 4 ms to minimize.
[2024-05-23 03:02:33] [INFO ] Deduced a trap composed of 193 places in 410 ms of which 6 ms to minimize.
[2024-05-23 03:02:34] [INFO ] Deduced a trap composed of 145 places in 415 ms of which 5 ms to minimize.
[2024-05-23 03:02:34] [INFO ] Deduced a trap composed of 156 places in 359 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:02:36] [INFO ] Deduced a trap composed of 220 places in 424 ms of which 5 ms to minimize.
[2024-05-23 03:02:36] [INFO ] Deduced a trap composed of 118 places in 370 ms of which 6 ms to minimize.
[2024-05-23 03:02:36] [INFO ] Deduced a trap composed of 131 places in 394 ms of which 5 ms to minimize.
[2024-05-23 03:02:37] [INFO ] Deduced a trap composed of 182 places in 419 ms of which 6 ms to minimize.
[2024-05-23 03:02:37] [INFO ] Deduced a trap composed of 169 places in 372 ms of which 3 ms to minimize.
[2024-05-23 03:02:38] [INFO ] Deduced a trap composed of 145 places in 295 ms of which 3 ms to minimize.
[2024-05-23 03:02:38] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 3 ms to minimize.
[2024-05-23 03:02:38] [INFO ] Deduced a trap composed of 141 places in 354 ms of which 5 ms to minimize.
[2024-05-23 03:02:39] [INFO ] Deduced a trap composed of 128 places in 416 ms of which 5 ms to minimize.
[2024-05-23 03:02:39] [INFO ] Deduced a trap composed of 71 places in 414 ms of which 5 ms to minimize.
[2024-05-23 03:02:40] [INFO ] Deduced a trap composed of 211 places in 401 ms of which 6 ms to minimize.
[2024-05-23 03:02:40] [INFO ] Deduced a trap composed of 184 places in 416 ms of which 5 ms to minimize.
[2024-05-23 03:02:40] [INFO ] Deduced a trap composed of 195 places in 411 ms of which 5 ms to minimize.
[2024-05-23 03:02:41] [INFO ] Deduced a trap composed of 113 places in 431 ms of which 6 ms to minimize.
[2024-05-23 03:02:41] [INFO ] Deduced a trap composed of 187 places in 437 ms of which 5 ms to minimize.
[2024-05-23 03:02:42] [INFO ] Deduced a trap composed of 106 places in 394 ms of which 4 ms to minimize.
[2024-05-23 03:02:42] [INFO ] Deduced a trap composed of 116 places in 339 ms of which 4 ms to minimize.
[2024-05-23 03:02:43] [INFO ] Deduced a trap composed of 159 places in 410 ms of which 6 ms to minimize.
[2024-05-23 03:02:43] [INFO ] Deduced a trap composed of 99 places in 398 ms of which 5 ms to minimize.
[2024-05-23 03:02:43] [INFO ] Deduced a trap composed of 114 places in 305 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1043 variables, and 59 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/310 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:02:51] [INFO ] Deduced a trap composed of 137 places in 318 ms of which 5 ms to minimize.
[2024-05-23 03:02:51] [INFO ] Deduced a trap composed of 130 places in 393 ms of which 5 ms to minimize.
[2024-05-23 03:02:52] [INFO ] Deduced a trap composed of 166 places in 482 ms of which 6 ms to minimize.
[2024-05-23 03:02:52] [INFO ] Deduced a trap composed of 145 places in 424 ms of which 5 ms to minimize.
[2024-05-23 03:02:53] [INFO ] Deduced a trap composed of 163 places in 433 ms of which 6 ms to minimize.
[2024-05-23 03:02:53] [INFO ] Deduced a trap composed of 78 places in 489 ms of which 5 ms to minimize.
[2024-05-23 03:02:54] [INFO ] Deduced a trap composed of 91 places in 372 ms of which 5 ms to minimize.
[2024-05-23 03:02:54] [INFO ] Deduced a trap composed of 156 places in 456 ms of which 6 ms to minimize.
[2024-05-23 03:02:55] [INFO ] Deduced a trap composed of 127 places in 378 ms of which 4 ms to minimize.
[2024-05-23 03:02:55] [INFO ] Deduced a trap composed of 109 places in 376 ms of which 5 ms to minimize.
[2024-05-23 03:02:55] [INFO ] Deduced a trap composed of 149 places in 454 ms of which 6 ms to minimize.
[2024-05-23 03:02:56] [INFO ] Deduced a trap composed of 130 places in 404 ms of which 6 ms to minimize.
[2024-05-23 03:02:57] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 5 ms to minimize.
[2024-05-23 03:02:57] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 5 ms to minimize.
[2024-05-23 03:02:58] [INFO ] Deduced a trap composed of 172 places in 424 ms of which 5 ms to minimize.
[2024-05-23 03:02:58] [INFO ] Deduced a trap composed of 200 places in 433 ms of which 5 ms to minimize.
[2024-05-23 03:02:59] [INFO ] Deduced a trap composed of 149 places in 376 ms of which 5 ms to minimize.
[2024-05-23 03:02:59] [INFO ] Deduced a trap composed of 115 places in 305 ms of which 3 ms to minimize.
[2024-05-23 03:02:59] [INFO ] Deduced a trap composed of 88 places in 370 ms of which 5 ms to minimize.
[2024-05-23 03:03:00] [INFO ] Deduced a trap composed of 82 places in 413 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:03:03] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 4 ms to minimize.
[2024-05-23 03:03:03] [INFO ] Deduced a trap composed of 177 places in 240 ms of which 3 ms to minimize.
[2024-05-23 03:03:03] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 3 ms to minimize.
[2024-05-23 03:03:04] [INFO ] Deduced a trap composed of 156 places in 319 ms of which 3 ms to minimize.
[2024-05-23 03:03:04] [INFO ] Deduced a trap composed of 166 places in 413 ms of which 5 ms to minimize.
[2024-05-23 03:03:04] [INFO ] Deduced a trap composed of 171 places in 403 ms of which 5 ms to minimize.
[2024-05-23 03:03:05] [INFO ] Deduced a trap composed of 150 places in 403 ms of which 5 ms to minimize.
[2024-05-23 03:03:05] [INFO ] Deduced a trap composed of 189 places in 375 ms of which 4 ms to minimize.
[2024-05-23 03:03:06] [INFO ] Deduced a trap composed of 165 places in 410 ms of which 5 ms to minimize.
[2024-05-23 03:03:06] [INFO ] Deduced a trap composed of 199 places in 334 ms of which 4 ms to minimize.
[2024-05-23 03:03:07] [INFO ] Deduced a trap composed of 139 places in 406 ms of which 5 ms to minimize.
[2024-05-23 03:03:07] [INFO ] Deduced a trap composed of 118 places in 413 ms of which 5 ms to minimize.
[2024-05-23 03:03:07] [INFO ] Deduced a trap composed of 196 places in 459 ms of which 6 ms to minimize.
[2024-05-23 03:03:08] [INFO ] Deduced a trap composed of 91 places in 403 ms of which 7 ms to minimize.
[2024-05-23 03:03:08] [INFO ] Deduced a trap composed of 133 places in 397 ms of which 5 ms to minimize.
[2024-05-23 03:03:09] [INFO ] Deduced a trap composed of 114 places in 410 ms of which 5 ms to minimize.
[2024-05-23 03:03:09] [INFO ] Deduced a trap composed of 174 places in 463 ms of which 6 ms to minimize.
[2024-05-23 03:03:10] [INFO ] Deduced a trap composed of 174 places in 378 ms of which 5 ms to minimize.
[2024-05-23 03:03:10] [INFO ] Deduced a trap composed of 161 places in 435 ms of which 5 ms to minimize.
[2024-05-23 03:03:11] [INFO ] Deduced a trap composed of 192 places in 436 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-05-23 03:03:14] [INFO ] Deduced a trap composed of 126 places in 216 ms of which 4 ms to minimize.
[2024-05-23 03:03:15] [INFO ] Deduced a trap composed of 135 places in 252 ms of which 3 ms to minimize.
[2024-05-23 03:03:16] [INFO ] Deduced a trap composed of 188 places in 371 ms of which 5 ms to minimize.
[2024-05-23 03:03:16] [INFO ] Deduced a trap composed of 99 places in 393 ms of which 4 ms to minimize.
[2024-05-23 03:03:16] [INFO ] Deduced a trap composed of 174 places in 340 ms of which 4 ms to minimize.
[2024-05-23 03:03:17] [INFO ] Deduced a trap composed of 126 places in 308 ms of which 6 ms to minimize.
[2024-05-23 03:03:17] [INFO ] Deduced a trap composed of 115 places in 372 ms of which 6 ms to minimize.
[2024-05-23 03:03:17] [INFO ] Deduced a trap composed of 157 places in 283 ms of which 3 ms to minimize.
[2024-05-23 03:03:18] [INFO ] Deduced a trap composed of 195 places in 305 ms of which 5 ms to minimize.
SMT process timed out in 61905ms, After SMT, problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 62047ms
Starting structural reductions in LTL mode, iteration 1 : 310/401 places, 733/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66118 ms. Remains : 310/401 places, 733/1328 transitions.
Support contains 37 out of 310 places after structural reductions.
[2024-05-23 03:03:18] [INFO ] Flatten gal took : 147 ms
[2024-05-23 03:03:18] [INFO ] Flatten gal took : 83 ms
[2024-05-23 03:03:19] [INFO ] Input system was already deterministic with 733 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8 resets) in 2393 ms. (16 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
[2024-05-23 03:03:20] [INFO ] Invariant cache hit.
[2024-05-23 03:03:20] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/296 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14/310 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 03:03:20] [INFO ] Deduced a trap composed of 172 places in 377 ms of which 5 ms to minimize.
[2024-05-23 03:03:21] [INFO ] Deduced a trap composed of 112 places in 354 ms of which 5 ms to minimize.
[2024-05-23 03:03:21] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 3 ms to minimize.
[2024-05-23 03:03:21] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 5 ms to minimize.
[2024-05-23 03:03:22] [INFO ] Deduced a trap composed of 122 places in 327 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 733/1043 variables, 310/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1043 variables, 56/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1043 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1043 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 390 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 310/310 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/296 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 7 (OVERLAPS) 14/310 variables, 10/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 5/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 733/1043 variables, 310/334 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1043 variables, 56/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1043 variables, 2/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1043 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1043 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 392 constraints, problems are : Problem set: 1 solved, 2 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 310/310 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 3275ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 292 ms.
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 131 place count 235 transition count 406
Iterating global reduction 0 with 19 rules applied. Total rules applied 150 place count 235 transition count 406
Applied a total of 150 rules in 72 ms. Remains 235 /310 variables (removed 75) and now considering 406/733 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 235/310 places, 406/733 transitions.
RANDOM walk for 40000 steps (8 resets) in 399 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 71533 steps, run visited all 2 properties in 867 ms. (steps per millisecond=82 )
Probabilistic random walk after 71533 steps, saw 50828 distinct states, run finished after 878 ms. (steps per millisecond=81 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Anderson-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0))||G(p1)) U G(!p2)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 130 place count 236 transition count 421
Iterating global reduction 0 with 18 rules applied. Total rules applied 148 place count 236 transition count 421
Applied a total of 148 rules in 99 ms. Remains 236 /310 variables (removed 74) and now considering 421/733 (removed 312) transitions.
// Phase 1: matrix 421 rows 236 cols
[2024-05-23 03:03:25] [INFO ] Computed 19 invariants in 10 ms
[2024-05-23 03:03:25] [INFO ] Implicit Places using invariants in 416 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 428 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/310 places, 421/733 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 235 transition count 360
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 174 transition count 360
Applied a total of 122 rules in 23 ms. Remains 174 /235 variables (removed 61) and now considering 360/421 (removed 61) transitions.
// Phase 1: matrix 360 rows 174 cols
[2024-05-23 03:03:26] [INFO ] Computed 18 invariants in 8 ms
[2024-05-23 03:03:26] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-23 03:03:26] [INFO ] Invariant cache hit.
[2024-05-23 03:03:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:03:26] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/310 places, 360/733 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1506 ms. Remains : 174/310 places, 360/733 transitions.
Stuttering acceptance computed with spot in 466 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 33360 reset in 502 ms.
Product exploration explored 100000 steps with 33416 reset in 354 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 147 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) p2 p1)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 902 ms. (44 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
[2024-05-23 03:03:29] [INFO ] Invariant cache hit.
[2024-05-23 03:03:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 174/534 variables, and 18 constraints, problems are : Problem set: 2 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/174 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR (NOT p2) p1)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F p1), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 27 factoid took 619 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 174 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 360/360 transitions.
Applied a total of 0 rules in 16 ms. Remains 174 /174 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2024-05-23 03:03:30] [INFO ] Invariant cache hit.
[2024-05-23 03:03:30] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-23 03:03:30] [INFO ] Invariant cache hit.
[2024-05-23 03:03:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:03:31] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
[2024-05-23 03:03:31] [INFO ] Redundant transitions in 44 ms returned []
Running 352 sub problems to find dead transitions.
[2024-05-23 03:03:31] [INFO ] Invariant cache hit.
[2024-05-23 03:03:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 03:03:35] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 2 ms to minimize.
[2024-05-23 03:03:35] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 2 ms to minimize.
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 3 ms to minimize.
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-23 03:03:36] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 3 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 2 ms to minimize.
[2024-05-23 03:03:37] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 3 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-05-23 03:03:38] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 3 ms to minimize.
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 03:03:39] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2024-05-23 03:03:40] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 3 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 4 ms to minimize.
[2024-05-23 03:03:41] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 4 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 3 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 4 ms to minimize.
[2024-05-23 03:03:42] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 2 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 3 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2024-05-23 03:03:43] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 2 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 3 ms to minimize.
[2024-05-23 03:03:44] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 03:03:48] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 3 ms to minimize.
[2024-05-23 03:03:48] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2024-05-23 03:03:48] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:03:48] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-23 03:03:48] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 4 ms to minimize.
[2024-05-23 03:03:49] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 5 ms to minimize.
[2024-05-23 03:03:49] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-23 03:03:49] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 3 ms to minimize.
[2024-05-23 03:03:49] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 5 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-23 03:03:50] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 4 ms to minimize.
[2024-05-23 03:03:51] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-23 03:03:52] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 3 ms to minimize.
[2024-05-23 03:03:53] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 3 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-23 03:03:54] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
[2024-05-23 03:03:55] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-23 03:03:55] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-05-23 03:03:55] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-05-23 03:03:56] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:03:56] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:03:56] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 3 ms to minimize.
[2024-05-23 03:03:56] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 3 ms to minimize.
[2024-05-23 03:03:56] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 4 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:03:57] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:03:58] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 3 ms to minimize.
[2024-05-23 03:04:00] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 4 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-05-23 03:04:01] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-23 03:04:02] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
[2024-05-23 03:04:02] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 30502ms, After SMT, problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 30512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31960 ms. Remains : 174/174 places, 360/360 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 (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 37582 steps (8 resets) in 122 ms. (305 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[p2, (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 176 ms.
Stack based approach found an accepted trace after 95800 steps with 0 reset with depth 95801 and stack size 52204 in 550 ms.
FORMULA Anderson-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-00 finished in 38724 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(G(p0)))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 10 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 03:04:04] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 03:04:04] [INFO ] Implicit Places using invariants in 411 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 5 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 428 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-01 finished in 534 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(((p1 U !p2)&&p0))&&F(p2)&&X(p3)))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 10 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 03:04:04] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 03:04:05] [INFO ] Implicit Places using invariants in 372 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) p2), (NOT p2), (NOT p3), p2, true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 115 steps with 2 reset with depth 112 and stack size 112 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-03 finished in 857 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(X(X(X(F(p0))))))'
Support contains 2 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 9 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-23 03:04:05] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 03:04:05] [INFO ] Implicit Places using invariants in 430 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 290 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 1 ms.
FORMULA Anderson-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-04 finished in 925 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(p1))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 310 transition count 677
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 254 transition count 677
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 132 place count 234 transition count 391
Iterating global reduction 0 with 20 rules applied. Total rules applied 152 place count 234 transition count 391
Applied a total of 152 rules in 25 ms. Remains 234 /310 variables (removed 76) and now considering 391/733 (removed 342) transitions.
// Phase 1: matrix 391 rows 234 cols
[2024-05-23 03:04:06] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 03:04:06] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 03:04:06] [INFO ] Invariant cache hit.
[2024-05-23 03:04:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-23 03:04:07] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2024-05-23 03:04:07] [INFO ] Redundant transitions in 7 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-23 03:04:07] [INFO ] Invariant cache hit.
[2024-05-23 03:04:07] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 03:04:10] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:04:11] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 3 ms to minimize.
[2024-05-23 03:04:11] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 4 ms to minimize.
[2024-05-23 03:04:12] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 3 ms to minimize.
[2024-05-23 03:04:12] [INFO ] Deduced a trap composed of 98 places in 302 ms of which 2 ms to minimize.
[2024-05-23 03:04:12] [INFO ] Deduced a trap composed of 108 places in 199 ms of which 2 ms to minimize.
[2024-05-23 03:04:13] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-05-23 03:04:13] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 3 ms to minimize.
[2024-05-23 03:04:13] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 3 ms to minimize.
[2024-05-23 03:04:13] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 2 ms to minimize.
[2024-05-23 03:04:13] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 3 ms to minimize.
[2024-05-23 03:04:14] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 3 ms to minimize.
[2024-05-23 03:04:14] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2024-05-23 03:04:14] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 3 ms to minimize.
[2024-05-23 03:04:14] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:04:14] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-23 03:04:15] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 2 ms to minimize.
[2024-05-23 03:04:15] [INFO ] Deduced a trap composed of 157 places in 195 ms of which 2 ms to minimize.
[2024-05-23 03:04:15] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 3 ms to minimize.
[2024-05-23 03:04:15] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 03:04:16] [INFO ] Deduced a trap composed of 92 places in 185 ms of which 3 ms to minimize.
[2024-05-23 03:04:17] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 3 ms to minimize.
[2024-05-23 03:04:17] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 3 ms to minimize.
[2024-05-23 03:04:18] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 3 ms to minimize.
[2024-05-23 03:04:18] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 2 ms to minimize.
[2024-05-23 03:04:18] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
[2024-05-23 03:04:19] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2024-05-23 03:04:19] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 2 ms to minimize.
[2024-05-23 03:04:19] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 2 ms to minimize.
[2024-05-23 03:04:19] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 3 ms to minimize.
[2024-05-23 03:04:19] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:04:21] [INFO ] Deduced a trap composed of 120 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 03:04:24] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 2 ms to minimize.
[2024-05-23 03:04:25] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-05-23 03:04:25] [INFO ] Deduced a trap composed of 143 places in 191 ms of which 3 ms to minimize.
[2024-05-23 03:04:25] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 3 ms to minimize.
[2024-05-23 03:04:25] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 3 ms to minimize.
[2024-05-23 03:04:26] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 3 ms to minimize.
[2024-05-23 03:04:26] [INFO ] Deduced a trap composed of 95 places in 193 ms of which 3 ms to minimize.
[2024-05-23 03:04:26] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 3 ms to minimize.
[2024-05-23 03:04:26] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 3 ms to minimize.
[2024-05-23 03:04:27] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 3 ms to minimize.
[2024-05-23 03:04:28] [INFO ] Deduced a trap composed of 132 places in 189 ms of which 2 ms to minimize.
[2024-05-23 03:04:28] [INFO ] Deduced a trap composed of 107 places in 189 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 03:04:29] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 2 ms to minimize.
[2024-05-23 03:04:30] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 4 ms to minimize.
[2024-05-23 03:04:30] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 2 ms to minimize.
[2024-05-23 03:04:30] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 3 ms to minimize.
[2024-05-23 03:04:30] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 3 ms to minimize.
[2024-05-23 03:04:30] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 3 ms to minimize.
[2024-05-23 03:04:31] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 2 ms to minimize.
[2024-05-23 03:04:31] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 2 ms to minimize.
[2024-05-23 03:04:31] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-05-23 03:04:31] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 2 ms to minimize.
[2024-05-23 03:04:32] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 3 ms to minimize.
[2024-05-23 03:04:32] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 2 ms to minimize.
[2024-05-23 03:04:32] [INFO ] Deduced a trap composed of 147 places in 167 ms of which 2 ms to minimize.
[2024-05-23 03:04:32] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 3 ms to minimize.
[2024-05-23 03:04:33] [INFO ] Deduced a trap composed of 103 places in 239 ms of which 4 ms to minimize.
[2024-05-23 03:04:33] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 3 ms to minimize.
[2024-05-23 03:04:34] [INFO ] Deduced a trap composed of 88 places in 276 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-05-23 03:04:38] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
SMT process timed out in 30430ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 30435ms
Starting structural reductions in SI_LTL mode, iteration 1 : 234/310 places, 391/733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31638 ms. Remains : 234/310 places, 391/733 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 192 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-05 finished in 31966 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(X((G(p0)||F(((!p1&&F((!p1&&G(!p2))))||G((F(!p1)&&F(G(!p2))))))))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 290 transition count 447
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 290 transition count 447
Applied a total of 40 rules in 8 ms. Remains 290 /310 variables (removed 20) and now considering 447/733 (removed 286) transitions.
// Phase 1: matrix 447 rows 290 cols
[2024-05-23 03:04:38] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 03:04:38] [INFO ] Implicit Places using invariants in 465 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 289/310 places, 447/733 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 481 ms. Remains : 289/310 places, 447/733 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), p2, p2, p1, (AND (NOT p0) p2)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 741 steps with 0 reset with depth 742 and stack size 543 in 2 ms.
FORMULA Anderson-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLFireability-06 finished in 993 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((G((F(p1)||p0))&&X((!p2 U (p3||G(!p2)))))))'
Support contains 6 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 477
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 477
Applied a total of 36 rules in 8 ms. Remains 292 /310 variables (removed 18) and now considering 477/733 (removed 256) transitions.
// Phase 1: matrix 477 rows 292 cols
[2024-05-23 03:04:39] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 03:04:39] [INFO ] Implicit Places using invariants in 426 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 427 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 291/310 places, 477/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 291 /291 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 440 ms. Remains : 291/310 places, 477/733 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), true]
Running random walk in product with property : Anderson-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 2 reset in 193 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 p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 95 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/3 properties
// Phase 1: matrix 477 rows 291 cols
[2024-05-23 03:04:40] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 03:04:40] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/284 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 291/768 variables, and 18 constraints, problems are : Problem set: 1 solved, 0 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-07 finished in 1455 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||(p1&&X(F(p1)))||G(F(p1))))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 448
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 448
Applied a total of 38 rules in 8 ms. Remains 291 /310 variables (removed 19) and now considering 448/733 (removed 285) transitions.
// Phase 1: matrix 448 rows 291 cols
[2024-05-23 03:04:40] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 03:04:41] [INFO ] Implicit Places using invariants in 401 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 448/733 transitions.
Applied a total of 0 rules in 3 ms. Remains 290 /290 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 290/310 places, 448/733 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Product exploration explored 100000 steps with 33333 reset in 456 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) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLFireability-12 finished in 1419 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(G((F(p1)&&p0))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 733/733 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 291 transition count 462
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 291 transition count 462
Applied a total of 38 rules in 8 ms. Remains 291 /310 variables (removed 19) and now considering 462/733 (removed 271) transitions.
// Phase 1: matrix 462 rows 291 cols
[2024-05-23 03:04:42] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 03:04:42] [INFO ] Implicit Places using invariants in 411 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 412 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 290/310 places, 462/733 transitions.
Applied a total of 0 rules in 4 ms. Remains 290 /290 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 424 ms. Remains : 290/310 places, 462/733 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLFireability-13 finished in 573 ms.
All properties solved by simple procedures.
Total runtime 151794 ms.

BK_STOP 1716433482858

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118400348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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