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-171620118400380.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 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 2.1M 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-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716465869011

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 12:04:31] [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 12:04:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:04:32] [INFO ] Load time of PNML (sax parser for PT used): 547 ms
[2024-05-23 12:04:32] [INFO ] Transformed 889 places.
[2024-05-23 12:04:32] [INFO ] Transformed 4152 transitions.
[2024-05-23 12:04:32] [INFO ] Found NUPN structural information;
[2024-05-23 12:04:32] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 904 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 238 place count 651 transition count 1516
Iterating global reduction 0 with 238 rules applied. Total rules applied 476 place count 651 transition count 1516
Applied a total of 476 rules in 249 ms. Remains 651 /889 variables (removed 238) and now considering 1516/4152 (removed 2636) transitions.
// Phase 1: matrix 1516 rows 651 cols
[2024-05-23 12:04:33] [INFO ] Computed 27 invariants in 141 ms
[2024-05-23 12:04:35] [INFO ] Implicit Places using invariants in 2239 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2289 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/889 places, 1516/4152 transitions.
Applied a total of 0 rules in 28 ms. Remains 650 /650 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2598 ms. Remains : 650/889 places, 1516/4152 transitions.
Support contains 47 out of 650 places after structural reductions.
[2024-05-23 12:04:36] [INFO ] Flatten gal took : 214 ms
[2024-05-23 12:04:36] [INFO ] Flatten gal took : 136 ms
[2024-05-23 12:04:36] [INFO ] Input system was already deterministic with 1516 transitions.
Support contains 46 out of 650 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3435 ms. (11 steps per ms) remains 20/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
// Phase 1: matrix 1516 rows 650 cols
[2024-05-23 12:04:38] [INFO ] Computed 26 invariants in 64 ms
[2024-05-23 12:04:38] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 597/628 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 14/642 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 8/650 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1516/2166 variables, 650/676 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2166 variables, 132/808 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2166 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2166/2166 variables, and 808 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 650/650 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 597/628 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 14/642 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/650 variables, 8/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-23 12:04:45] [INFO ] Deduced a trap composed of 299 places in 645 ms of which 74 ms to minimize.
[2024-05-23 12:04:46] [INFO ] Deduced a trap composed of 172 places in 669 ms of which 11 ms to minimize.
[2024-05-23 12:04:46] [INFO ] Deduced a trap composed of 267 places in 668 ms of which 15 ms to minimize.
[2024-05-23 12:04:47] [INFO ] Deduced a trap composed of 185 places in 558 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 4/30 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-23 12:04:48] [INFO ] Deduced a trap composed of 172 places in 578 ms of which 6 ms to minimize.
SMT process timed out in 10409ms, After SMT, problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 650 transition count 1389
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 254 place count 523 transition count 1389
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 254 place count 523 transition count 1257
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 518 place count 391 transition count 1257
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 527 place count 382 transition count 1116
Iterating global reduction 2 with 9 rules applied. Total rules applied 536 place count 382 transition count 1116
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 553 place count 382 transition count 1099
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 570 place count 365 transition count 1099
Applied a total of 570 rules in 226 ms. Remains 365 /650 variables (removed 285) and now considering 1099/1516 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 365/650 places, 1099/1516 transitions.
RANDOM walk for 40000 steps (8 resets) in 672 ms. (59 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 8/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 8/8 properties
// Phase 1: matrix 1099 rows 365 cols
[2024-05-23 12:04:49] [INFO ] Computed 26 invariants in 11 ms
[2024-05-23 12:04:49] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 322/337 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/341 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 23/364 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:04:50] [INFO ] Deduced a trap composed of 95 places in 305 ms of which 4 ms to minimize.
[2024-05-23 12:04:50] [INFO ] Deduced a trap composed of 128 places in 300 ms of which 4 ms to minimize.
[2024-05-23 12:04:50] [INFO ] Deduced a trap composed of 141 places in 472 ms of which 4 ms to minimize.
[2024-05-23 12:04:51] [INFO ] Deduced a trap composed of 122 places in 375 ms of which 4 ms to minimize.
[2024-05-23 12:04:51] [INFO ] Deduced a trap composed of 111 places in 371 ms of which 4 ms to minimize.
[2024-05-23 12:04:52] [INFO ] Deduced a trap composed of 63 places in 459 ms of which 6 ms to minimize.
[2024-05-23 12:04:52] [INFO ] Deduced a trap composed of 72 places in 454 ms of which 5 ms to minimize.
[2024-05-23 12:04:53] [INFO ] Deduced a trap composed of 63 places in 482 ms of which 6 ms to minimize.
[2024-05-23 12:04:54] [INFO ] Deduced a trap composed of 154 places in 899 ms of which 13 ms to minimize.
[2024-05-23 12:04:54] [INFO ] Deduced a trap composed of 148 places in 622 ms of which 10 ms to minimize.
[2024-05-23 12:04:55] [INFO ] Deduced a trap composed of 133 places in 357 ms of which 4 ms to minimize.
[2024-05-23 12:04:55] [INFO ] Deduced a trap composed of 110 places in 679 ms of which 4 ms to minimize.
[2024-05-23 12:04:56] [INFO ] Deduced a trap composed of 79 places in 516 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:04:56] [INFO ] Deduced a trap composed of 122 places in 493 ms of which 4 ms to minimize.
[2024-05-23 12:04:57] [INFO ] Deduced a trap composed of 106 places in 518 ms of which 4 ms to minimize.
[2024-05-23 12:04:57] [INFO ] Deduced a trap composed of 96 places in 446 ms of which 3 ms to minimize.
[2024-05-23 12:04:58] [INFO ] Deduced a trap composed of 116 places in 391 ms of which 4 ms to minimize.
[2024-05-23 12:04:59] [INFO ] Deduced a trap composed of 95 places in 841 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:04:59] [INFO ] Deduced a trap composed of 119 places in 334 ms of which 4 ms to minimize.
[2024-05-23 12:05:00] [INFO ] Deduced a trap composed of 89 places in 690 ms of which 8 ms to minimize.
[2024-05-23 12:05:00] [INFO ] Deduced a trap composed of 97 places in 387 ms of which 4 ms to minimize.
[2024-05-23 12:05:01] [INFO ] Deduced a trap composed of 104 places in 362 ms of which 3 ms to minimize.
[2024-05-23 12:05:01] [INFO ] Deduced a trap composed of 148 places in 432 ms of which 4 ms to minimize.
[2024-05-23 12:05:02] [INFO ] Deduced a trap composed of 94 places in 794 ms of which 7 ms to minimize.
[2024-05-23 12:05:02] [INFO ] Deduced a trap composed of 94 places in 405 ms of which 4 ms to minimize.
[2024-05-23 12:05:03] [INFO ] Deduced a trap composed of 158 places in 581 ms of which 4 ms to minimize.
[2024-05-23 12:05:03] [INFO ] Deduced a trap composed of 85 places in 399 ms of which 4 ms to minimize.
[2024-05-23 12:05:04] [INFO ] Deduced a trap composed of 138 places in 389 ms of which 5 ms to minimize.
[2024-05-23 12:05:04] [INFO ] Deduced a trap composed of 99 places in 420 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:05] [INFO ] Deduced a trap composed of 85 places in 409 ms of which 4 ms to minimize.
[2024-05-23 12:05:05] [INFO ] Deduced a trap composed of 71 places in 435 ms of which 4 ms to minimize.
[2024-05-23 12:05:06] [INFO ] Deduced a trap composed of 93 places in 349 ms of which 4 ms to minimize.
[2024-05-23 12:05:06] [INFO ] Deduced a trap composed of 134 places in 362 ms of which 4 ms to minimize.
[2024-05-23 12:05:07] [INFO ] Deduced a trap composed of 132 places in 447 ms of which 5 ms to minimize.
[2024-05-23 12:05:07] [INFO ] Deduced a trap composed of 94 places in 431 ms of which 6 ms to minimize.
[2024-05-23 12:05:08] [INFO ] Deduced a trap composed of 165 places in 464 ms of which 4 ms to minimize.
[2024-05-23 12:05:08] [INFO ] Deduced a trap composed of 167 places in 462 ms of which 4 ms to minimize.
[2024-05-23 12:05:08] [INFO ] Deduced a trap composed of 143 places in 479 ms of which 4 ms to minimize.
[2024-05-23 12:05:09] [INFO ] Deduced a trap composed of 155 places in 372 ms of which 4 ms to minimize.
[2024-05-23 12:05:09] [INFO ] Deduced a trap composed of 158 places in 466 ms of which 4 ms to minimize.
[2024-05-23 12:05:10] [INFO ] Deduced a trap composed of 128 places in 475 ms of which 4 ms to minimize.
[2024-05-23 12:05:10] [INFO ] Deduced a trap composed of 124 places in 469 ms of which 4 ms to minimize.
[2024-05-23 12:05:11] [INFO ] Deduced a trap composed of 112 places in 431 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/365 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:12] [INFO ] Deduced a trap composed of 60 places in 449 ms of which 6 ms to minimize.
[2024-05-23 12:05:12] [INFO ] Deduced a trap composed of 78 places in 472 ms of which 4 ms to minimize.
[2024-05-23 12:05:13] [INFO ] Deduced a trap composed of 60 places in 368 ms of which 4 ms to minimize.
[2024-05-23 12:05:13] [INFO ] Deduced a trap composed of 66 places in 454 ms of which 4 ms to minimize.
[2024-05-23 12:05:14] [INFO ] Deduced a trap composed of 66 places in 466 ms of which 4 ms to minimize.
[2024-05-23 12:05:14] [INFO ] Deduced a trap composed of 118 places in 430 ms of which 4 ms to minimize.
[2024-05-23 12:05:15] [INFO ] Deduced a trap composed of 68 places in 357 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:15] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 4 ms to minimize.
[2024-05-23 12:05:16] [INFO ] Deduced a trap composed of 80 places in 459 ms of which 6 ms to minimize.
[2024-05-23 12:05:16] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 4 ms to minimize.
[2024-05-23 12:05:17] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 3 ms to minimize.
[2024-05-23 12:05:17] [INFO ] Deduced a trap composed of 68 places in 376 ms of which 4 ms to minimize.
[2024-05-23 12:05:17] [INFO ] Deduced a trap composed of 74 places in 373 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:18] [INFO ] Deduced a trap composed of 54 places in 445 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:19] [INFO ] Deduced a trap composed of 97 places in 344 ms of which 3 ms to minimize.
[2024-05-23 12:05:19] [INFO ] Deduced a trap composed of 95 places in 363 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:20] [INFO ] Deduced a trap composed of 137 places in 383 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1099/1464 variables, 365/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1464 variables, 132/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1464 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/1464 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1464/1464 variables, and 583 constraints, problems are : Problem set: 0 solved, 8 unsolved in 34524 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 322/337 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/341 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 23/364 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:24] [INFO ] Deduced a trap composed of 116 places in 418 ms of which 5 ms to minimize.
[2024-05-23 12:05:25] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 4 ms to minimize.
[2024-05-23 12:05:25] [INFO ] Deduced a trap composed of 121 places in 372 ms of which 4 ms to minimize.
[2024-05-23 12:05:25] [INFO ] Deduced a trap composed of 149 places in 456 ms of which 5 ms to minimize.
[2024-05-23 12:05:26] [INFO ] Deduced a trap composed of 105 places in 373 ms of which 4 ms to minimize.
[2024-05-23 12:05:26] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 6 ms to minimize.
[2024-05-23 12:05:27] [INFO ] Deduced a trap composed of 137 places in 456 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/365 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:28] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 4 ms to minimize.
[2024-05-23 12:05:29] [INFO ] Deduced a trap composed of 138 places in 367 ms of which 3 ms to minimize.
[2024-05-23 12:05:29] [INFO ] Deduced a trap composed of 112 places in 453 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1464 variables, 365/461 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1464 variables, 132/593 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1464 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1464 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 12:05:37] [INFO ] Deduced a trap composed of 107 places in 375 ms of which 5 ms to minimize.
[2024-05-23 12:05:38] [INFO ] Deduced a trap composed of 87 places in 293 ms of which 4 ms to minimize.
[2024-05-23 12:05:38] [INFO ] Deduced a trap composed of 160 places in 373 ms of which 3 ms to minimize.
[2024-05-23 12:05:39] [INFO ] Deduced a trap composed of 96 places in 388 ms of which 4 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/1464 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1464 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/1464 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1464/1464 variables, and 605 constraints, problems are : Problem set: 0 solved, 8 unsolved in 25754 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 365/365 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 74/74 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 15 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 1099/1099 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 892
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 892
Applied a total of 18 rules in 105 ms. Remains 356 /365 variables (removed 9) and now considering 892/1099 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 356/365 places, 892/1099 transitions.
RANDOM walk for 40000 steps (8 resets) in 1281 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/7 properties
// Phase 1: matrix 892 rows 356 cols
[2024-05-23 12:05:50] [INFO ] Computed 26 invariants in 11 ms
[2024-05-23 12:05:50] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/322 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/332 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/355 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/356 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 892/1248 variables, 356/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1248 variables, 132/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1248 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1248 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1248/1248 variables, and 514 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 356/356 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 318/322 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/332 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/355 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/356 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 892/1248 variables, 356/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1248 variables, 132/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1248 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1248 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1248 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1248/1248 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 356/356 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3185ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 321 ms.
Support contains 4 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 892/892 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 350 transition count 754
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 350 transition count 754
Applied a total of 12 rules in 30 ms. Remains 350 /356 variables (removed 6) and now considering 754/892 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 350/356 places, 754/892 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 278462 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 278462 steps, saw 220683 distinct states, run finished after 3009 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 754 rows 350 cols
[2024-05-23 12:05:57] [INFO ] Computed 26 invariants in 13 ms
[2024-05-23 12:05:57] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/349 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 754/1104 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1104 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1104 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1104 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 508 constraints, problems are : Problem set: 0 solved, 2 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/349 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 12:05:58] [INFO ] Deduced a trap composed of 78 places in 365 ms of which 4 ms to minimize.
[2024-05-23 12:05:59] [INFO ] Deduced a trap composed of 65 places in 367 ms of which 4 ms to minimize.
[2024-05-23 12:05:59] [INFO ] Deduced a trap composed of 131 places in 294 ms of which 3 ms to minimize.
[2024-05-23 12:05:59] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 5 ms to minimize.
[2024-05-23 12:06:00] [INFO ] Deduced a trap composed of 153 places in 314 ms of which 4 ms to minimize.
[2024-05-23 12:06:00] [INFO ] Deduced a trap composed of 149 places in 360 ms of which 3 ms to minimize.
[2024-05-23 12:06:00] [INFO ] Deduced a trap composed of 179 places in 376 ms of which 4 ms to minimize.
[2024-05-23 12:06:01] [INFO ] Deduced a trap composed of 169 places in 372 ms of which 4 ms to minimize.
[2024-05-23 12:06:01] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 4 ms to minimize.
[2024-05-23 12:06:02] [INFO ] Deduced a trap composed of 158 places in 356 ms of which 3 ms to minimize.
[2024-05-23 12:06:02] [INFO ] Deduced a trap composed of 142 places in 365 ms of which 4 ms to minimize.
[2024-05-23 12:06:02] [INFO ] Deduced a trap composed of 145 places in 315 ms of which 4 ms to minimize.
[2024-05-23 12:06:03] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-05-23 12:06:03] [INFO ] Deduced a trap composed of 106 places in 358 ms of which 4 ms to minimize.
[2024-05-23 12:06:03] [INFO ] Deduced a trap composed of 64 places in 353 ms of which 4 ms to minimize.
[2024-05-23 12:06:04] [INFO ] Deduced a trap composed of 176 places in 362 ms of which 4 ms to minimize.
[2024-05-23 12:06:04] [INFO ] Deduced a trap composed of 139 places in 365 ms of which 4 ms to minimize.
[2024-05-23 12:06:05] [INFO ] Deduced a trap composed of 90 places in 353 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 12:06:05] [INFO ] Deduced a trap composed of 89 places in 364 ms of which 4 ms to minimize.
[2024-05-23 12:06:05] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 754/1104 variables, 350/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1104 variables, 132/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1104 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1104 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1104 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 530 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8443 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints]
After SMT, in 9295ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 327 ms.
Support contains 4 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 30 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 350/350 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 29 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2024-05-23 12:06:07] [INFO ] Invariant cache hit.
[2024-05-23 12:06:07] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-23 12:06:07] [INFO ] Invariant cache hit.
[2024-05-23 12:06:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:06:09] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-23 12:06:09] [INFO ] Redundant transitions in 73 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-23 12:06:09] [INFO ] Invariant cache hit.
[2024-05-23 12:06:09] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-23 12:06:22] [INFO ] Deduced a trap composed of 94 places in 393 ms of which 4 ms to minimize.
[2024-05-23 12:06:23] [INFO ] Deduced a trap composed of 150 places in 380 ms of which 5 ms to minimize.
[2024-05-23 12:06:23] [INFO ] Deduced a trap composed of 123 places in 283 ms of which 4 ms to minimize.
[2024-05-23 12:06:24] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 6 ms to minimize.
[2024-05-23 12:06:24] [INFO ] Deduced a trap composed of 142 places in 362 ms of which 4 ms to minimize.
[2024-05-23 12:06:24] [INFO ] Deduced a trap composed of 79 places in 356 ms of which 4 ms to minimize.
[2024-05-23 12:06:26] [INFO ] Deduced a trap composed of 100 places in 321 ms of which 5 ms to minimize.
[2024-05-23 12:06:27] [INFO ] Deduced a trap composed of 132 places in 347 ms of which 4 ms to minimize.
[2024-05-23 12:06:28] [INFO ] Deduced a trap composed of 119 places in 394 ms of which 4 ms to minimize.
[2024-05-23 12:06:28] [INFO ] Deduced a trap composed of 102 places in 492 ms of which 12 ms to minimize.
[2024-05-23 12:06:29] [INFO ] Deduced a trap composed of 100 places in 686 ms of which 6 ms to minimize.
[2024-05-23 12:06:30] [INFO ] Deduced a trap composed of 103 places in 323 ms of which 4 ms to minimize.
[2024-05-23 12:06:30] [INFO ] Deduced a trap composed of 125 places in 325 ms of which 3 ms to minimize.
[2024-05-23 12:06:30] [INFO ] Deduced a trap composed of 93 places in 296 ms of which 4 ms to minimize.
[2024-05-23 12:06:31] [INFO ] Deduced a trap composed of 103 places in 377 ms of which 4 ms to minimize.
[2024-05-23 12:06:31] [INFO ] Deduced a trap composed of 104 places in 386 ms of which 4 ms to minimize.
[2024-05-23 12:06:31] [INFO ] Deduced a trap composed of 96 places in 306 ms of which 4 ms to minimize.
[2024-05-23 12:06:32] [INFO ] Deduced a trap composed of 87 places in 425 ms of which 6 ms to minimize.
[2024-05-23 12:06:32] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 4 ms to minimize.
[2024-05-23 12:06:33] [INFO ] Deduced a trap composed of 100 places in 388 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-23 12:06:37] [INFO ] Deduced a trap composed of 114 places in 313 ms of which 4 ms to minimize.
[2024-05-23 12:06:38] [INFO ] Deduced a trap composed of 150 places in 314 ms of which 4 ms to minimize.
[2024-05-23 12:06:38] [INFO ] Deduced a trap composed of 142 places in 300 ms of which 3 ms to minimize.
[2024-05-23 12:06:38] [INFO ] Deduced a trap composed of 109 places in 298 ms of which 3 ms to minimize.
[2024-05-23 12:06:39] [INFO ] Deduced a trap composed of 97 places in 300 ms of which 3 ms to minimize.
[2024-05-23 12:06:39] [INFO ] Deduced a trap composed of 99 places in 296 ms of which 4 ms to minimize.
[2024-05-23 12:06:39] [INFO ] Deduced a trap composed of 90 places in 298 ms of which 3 ms to minimize.
[2024-05-23 12:06:40] [INFO ] Deduced a trap composed of 91 places in 361 ms of which 3 ms to minimize.
[2024-05-23 12:06:40] [INFO ] Deduced a trap composed of 82 places in 297 ms of which 4 ms to minimize.
[2024-05-23 12:06:40] [INFO ] Deduced a trap composed of 83 places in 296 ms of which 3 ms to minimize.
[2024-05-23 12:06:41] [INFO ] Deduced a trap composed of 87 places in 308 ms of which 3 ms to minimize.
SMT process timed out in 31529ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 31551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34174 ms. Remains : 350/350 places, 754/754 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-15 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 284 place count 508 transition count 1242
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 548 place count 376 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 572 place count 352 transition count 756
Iterating global reduction 2 with 24 rules applied. Total rules applied 596 place count 352 transition count 756
Applied a total of 596 rules in 95 ms. Remains 352 /650 variables (removed 298) and now considering 756/1516 (removed 760) transitions.
// Phase 1: matrix 756 rows 352 cols
[2024-05-23 12:06:41] [INFO ] Computed 26 invariants in 19 ms
[2024-05-23 12:06:42] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-23 12:06:42] [INFO ] Invariant cache hit.
[2024-05-23 12:06:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:06:44] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2024-05-23 12:06:44] [INFO ] Redundant transitions in 33 ms returned []
Running 744 sub problems to find dead transitions.
[2024-05-23 12:06:44] [INFO ] Invariant cache hit.
[2024-05-23 12:06:44] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-23 12:06:55] [INFO ] Deduced a trap composed of 114 places in 477 ms of which 6 ms to minimize.
[2024-05-23 12:06:56] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 6 ms to minimize.
[2024-05-23 12:06:57] [INFO ] Deduced a trap composed of 82 places in 486 ms of which 6 ms to minimize.
[2024-05-23 12:06:57] [INFO ] Deduced a trap composed of 110 places in 496 ms of which 6 ms to minimize.
[2024-05-23 12:06:58] [INFO ] Deduced a trap composed of 75 places in 473 ms of which 6 ms to minimize.
[2024-05-23 12:06:58] [INFO ] Deduced a trap composed of 85 places in 490 ms of which 6 ms to minimize.
[2024-05-23 12:06:59] [INFO ] Deduced a trap composed of 47 places in 503 ms of which 7 ms to minimize.
[2024-05-23 12:07:02] [INFO ] Deduced a trap composed of 105 places in 495 ms of which 6 ms to minimize.
[2024-05-23 12:07:03] [INFO ] Deduced a trap composed of 69 places in 505 ms of which 6 ms to minimize.
[2024-05-23 12:07:03] [INFO ] Deduced a trap composed of 60 places in 491 ms of which 6 ms to minimize.
[2024-05-23 12:07:04] [INFO ] Deduced a trap composed of 87 places in 547 ms of which 6 ms to minimize.
[2024-05-23 12:07:05] [INFO ] Deduced a trap composed of 113 places in 523 ms of which 6 ms to minimize.
[2024-05-23 12:07:05] [INFO ] Deduced a trap composed of 113 places in 518 ms of which 7 ms to minimize.
[2024-05-23 12:07:06] [INFO ] Deduced a trap composed of 113 places in 423 ms of which 5 ms to minimize.
[2024-05-23 12:07:06] [INFO ] Deduced a trap composed of 110 places in 493 ms of which 6 ms to minimize.
[2024-05-23 12:07:07] [INFO ] Deduced a trap composed of 106 places in 486 ms of which 7 ms to minimize.
[2024-05-23 12:07:07] [INFO ] Deduced a trap composed of 93 places in 525 ms of which 6 ms to minimize.
[2024-05-23 12:07:08] [INFO ] Deduced a trap composed of 75 places in 511 ms of which 6 ms to minimize.
[2024-05-23 12:07:08] [INFO ] Deduced a trap composed of 116 places in 503 ms of which 6 ms to minimize.
[2024-05-23 12:07:09] [INFO ] Deduced a trap composed of 128 places in 507 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-23 12:07:15] [INFO ] Deduced a trap composed of 114 places in 500 ms of which 6 ms to minimize.
SMT process timed out in 30950ms, After SMT, problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 30960ms
Starting structural reductions in SI_LTL mode, iteration 1 : 352/650 places, 756/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33372 ms. Remains : 352/650 places, 756/1516 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 752 ms.
Product exploration explored 100000 steps with 0 reset in 573 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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 1/4 properties
[2024-05-23 12:07:17] [INFO ] Invariant cache hit.
[2024-05-23 12:07:17] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 317/1108 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms 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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 36073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||X(X(G(p2)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 59 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 12:07:17] [INFO ] Computed 26 invariants in 17 ms
[2024-05-23 12:07:18] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-23 12:07:18] [INFO ] Invariant cache hit.
[2024-05-23 12:07:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:07:26] [INFO ] Implicit Places using invariants and state equation in 7686 ms returned []
Implicit Place search using SMT with State Equation took 8673 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 12:07:26] [INFO ] Invariant cache hit.
[2024-05-23 12:07:26] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 26 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:08:02] [INFO ] Deduced a trap composed of 203 places in 523 ms of which 6 ms to minimize.
[2024-05-23 12:08:03] [INFO ] Deduced a trap composed of 175 places in 537 ms of which 6 ms to minimize.
[2024-05-23 12:08:04] [INFO ] Deduced a trap composed of 208 places in 641 ms of which 9 ms to minimize.
[2024-05-23 12:08:07] [INFO ] Deduced a trap composed of 107 places in 633 ms of which 9 ms to minimize.
[2024-05-23 12:08:09] [INFO ] Deduced a trap composed of 249 places in 558 ms of which 6 ms to minimize.
[2024-05-23 12:08:09] [INFO ] Deduced a trap composed of 280 places in 630 ms of which 8 ms to minimize.
[2024-05-23 12:08:10] [INFO ] Deduced a trap composed of 202 places in 618 ms of which 7 ms to minimize.
[2024-05-23 12:08:10] [INFO ] Deduced a trap composed of 341 places in 604 ms of which 6 ms to minimize.
[2024-05-23 12:08:11] [INFO ] Deduced a trap composed of 231 places in 689 ms of which 6 ms to minimize.
[2024-05-23 12:08:12] [INFO ] Deduced a trap composed of 199 places in 506 ms of which 6 ms to minimize.
[2024-05-23 12:08:13] [INFO ] Deduced a trap composed of 369 places in 837 ms of which 10 ms to minimize.
[2024-05-23 12:08:13] [INFO ] Deduced a trap composed of 323 places in 742 ms of which 6 ms to minimize.
[2024-05-23 12:08:14] [INFO ] Deduced a trap composed of 114 places in 677 ms of which 6 ms to minimize.
[2024-05-23 12:08:15] [INFO ] Deduced a trap composed of 213 places in 566 ms of which 7 ms to minimize.
[2024-05-23 12:08:15] [INFO ] Deduced a trap composed of 213 places in 546 ms of which 6 ms to minimize.
[2024-05-23 12:08:16] [INFO ] Deduced a trap composed of 373 places in 542 ms of which 7 ms to minimize.
[2024-05-23 12:08:17] [INFO ] Deduced a trap composed of 242 places in 637 ms of which 6 ms to minimize.
[2024-05-23 12:08:17] [INFO ] Deduced a trap composed of 280 places in 565 ms of which 6 ms to minimize.
[2024-05-23 12:08:18] [INFO ] Deduced a trap composed of 351 places in 645 ms of which 6 ms to minimize.
[2024-05-23 12:08:19] [INFO ] Deduced a trap composed of 139 places in 638 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1656 variables, and 46 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 20/20 constraints]
After SMT, in 61131ms problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 61145ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69883 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 227 steps with 0 reset with depth 228 and stack size 228 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 70505 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))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 625 transition count 1007
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 625 transition count 1007
Applied a total of 50 rules in 38 ms. Remains 625 /650 variables (removed 25) and now considering 1007/1516 (removed 509) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-05-23 12:08:28] [INFO ] Computed 26 invariants in 9 ms
[2024-05-23 12:08:28] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-23 12:08:28] [INFO ] Invariant cache hit.
[2024-05-23 12:08:30] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:08:37] [INFO ] Implicit Places using invariants and state equation in 8624 ms returned []
Implicit Place search using SMT with State Equation took 9337 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2024-05-23 12:08:37] [INFO ] Invariant cache hit.
[2024-05-23 12:08:37] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
[2024-05-23 12:09:01] [INFO ] Deduced a trap composed of 82 places in 838 ms of which 11 ms to minimize.
[2024-05-23 12:09:02] [INFO ] Deduced a trap composed of 226 places in 844 ms of which 10 ms to minimize.
[2024-05-23 12:09:03] [INFO ] Deduced a trap composed of 219 places in 762 ms of which 10 ms to minimize.
[2024-05-23 12:09:04] [INFO ] Deduced a trap composed of 142 places in 834 ms of which 10 ms to minimize.
[2024-05-23 12:09:05] [INFO ] Deduced a trap composed of 140 places in 839 ms of which 10 ms to minimize.
[2024-05-23 12:09:06] [INFO ] Deduced a trap composed of 182 places in 810 ms of which 10 ms to minimize.
[2024-05-23 12:09:06] [INFO ] Deduced a trap composed of 289 places in 820 ms of which 10 ms to minimize.
[2024-05-23 12:09:07] [INFO ] Deduced a trap composed of 204 places in 796 ms of which 8 ms to minimize.
[2024-05-23 12:09:08] [INFO ] Deduced a trap composed of 171 places in 703 ms of which 10 ms to minimize.
SMT process timed out in 30834ms, After SMT, problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 30851ms
Starting structural reductions in LTL mode, iteration 1 : 625/650 places, 1007/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40229 ms. Remains : 625/650 places, 1007/1516 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1172 steps with 0 reset in 5 ms.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-03 finished in 40430 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(p1)&&p0))||X(F(p2))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 59 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 12:09:08] [INFO ] Computed 26 invariants in 14 ms
[2024-05-23 12:09:09] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-05-23 12:09:09] [INFO ] Invariant cache hit.
[2024-05-23 12:09:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:09:15] [INFO ] Implicit Places using invariants and state equation in 5590 ms returned []
Implicit Place search using SMT with State Equation took 6607 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 12:09:15] [INFO ] Invariant cache hit.
[2024-05-23 12:09:15] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:09:40] [INFO ] Deduced a trap composed of 151 places in 545 ms of which 7 ms to minimize.
[2024-05-23 12:09:41] [INFO ] Deduced a trap composed of 312 places in 533 ms of which 6 ms to minimize.
[2024-05-23 12:09:41] [INFO ] Deduced a trap composed of 232 places in 520 ms of which 5 ms to minimize.
[2024-05-23 12:09:42] [INFO ] Deduced a trap composed of 132 places in 534 ms of which 6 ms to minimize.
[2024-05-23 12:09:42] [INFO ] Deduced a trap composed of 226 places in 533 ms of which 6 ms to minimize.
[2024-05-23 12:09:43] [INFO ] Deduced a trap composed of 285 places in 501 ms of which 5 ms to minimize.
[2024-05-23 12:09:43] [INFO ] Deduced a trap composed of 170 places in 641 ms of which 9 ms to minimize.
[2024-05-23 12:09:44] [INFO ] Deduced a trap composed of 187 places in 601 ms of which 6 ms to minimize.
[2024-05-23 12:09:45] [INFO ] Deduced a trap composed of 318 places in 531 ms of which 6 ms to minimize.
[2024-05-23 12:09:46] [INFO ] Deduced a trap composed of 322 places in 531 ms of which 6 ms to minimize.
[2024-05-23 12:09:46] [INFO ] Deduced a trap composed of 238 places in 522 ms of which 5 ms to minimize.
SMT process timed out in 31347ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31360ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38033 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 471 ms.
Product exploration explored 100000 steps with 50000 reset in 497 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) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 17 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 39213 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' '!(((p0 U (p1||G(!p2)))&&F(G(p2))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 650 transition count 1375
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 509 transition count 1375
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 282 place count 509 transition count 1243
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 780
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 780
Applied a total of 592 rules in 52 ms. Remains 354 /650 variables (removed 296) and now considering 780/1516 (removed 736) transitions.
// Phase 1: matrix 780 rows 354 cols
[2024-05-23 12:09:47] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 12:09:48] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-23 12:09:48] [INFO ] Invariant cache hit.
[2024-05-23 12:09:48] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:09:50] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
[2024-05-23 12:09:50] [INFO ] Redundant transitions in 24 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-23 12:09:50] [INFO ] Invariant cache hit.
[2024-05-23 12:09:50] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 12:09:59] [INFO ] Deduced a trap composed of 97 places in 319 ms of which 4 ms to minimize.
[2024-05-23 12:09:59] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 4 ms to minimize.
[2024-05-23 12:09:59] [INFO ] Deduced a trap composed of 91 places in 323 ms of which 4 ms to minimize.
[2024-05-23 12:09:59] [INFO ] Deduced a trap composed of 150 places in 335 ms of which 4 ms to minimize.
[2024-05-23 12:10:00] [INFO ] Deduced a trap composed of 80 places in 357 ms of which 4 ms to minimize.
[2024-05-23 12:10:00] [INFO ] Deduced a trap composed of 49 places in 331 ms of which 6 ms to minimize.
[2024-05-23 12:10:03] [INFO ] Deduced a trap composed of 60 places in 385 ms of which 3 ms to minimize.
[2024-05-23 12:10:03] [INFO ] Deduced a trap composed of 72 places in 388 ms of which 4 ms to minimize.
[2024-05-23 12:10:03] [INFO ] Deduced a trap composed of 60 places in 373 ms of which 4 ms to minimize.
[2024-05-23 12:10:04] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 4 ms to minimize.
[2024-05-23 12:10:04] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 3 ms to minimize.
[2024-05-23 12:10:05] [INFO ] Deduced a trap composed of 103 places in 389 ms of which 6 ms to minimize.
[2024-05-23 12:10:05] [INFO ] Deduced a trap composed of 111 places in 386 ms of which 4 ms to minimize.
[2024-05-23 12:10:05] [INFO ] Deduced a trap composed of 106 places in 385 ms of which 4 ms to minimize.
[2024-05-23 12:10:06] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 4 ms to minimize.
[2024-05-23 12:10:07] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 4 ms to minimize.
[2024-05-23 12:10:07] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 4 ms to minimize.
[2024-05-23 12:10:08] [INFO ] Deduced a trap composed of 63 places in 396 ms of which 6 ms to minimize.
[2024-05-23 12:10:08] [INFO ] Deduced a trap composed of 78 places in 389 ms of which 6 ms to minimize.
[2024-05-23 12:10:08] [INFO ] Deduced a trap composed of 77 places in 367 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 12:10:13] [INFO ] Deduced a trap composed of 124 places in 316 ms of which 4 ms to minimize.
[2024-05-23 12:10:14] [INFO ] Deduced a trap composed of 121 places in 310 ms of which 3 ms to minimize.
[2024-05-23 12:10:15] [INFO ] Deduced a trap composed of 98 places in 317 ms of which 4 ms to minimize.
[2024-05-23 12:10:15] [INFO ] Deduced a trap composed of 108 places in 322 ms of which 3 ms to minimize.
[2024-05-23 12:10:15] [INFO ] Deduced a trap composed of 96 places in 311 ms of which 3 ms to minimize.
[2024-05-23 12:10:16] [INFO ] Deduced a trap composed of 80 places in 313 ms of which 4 ms to minimize.
[2024-05-23 12:10:16] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 3 ms to minimize.
[2024-05-23 12:10:16] [INFO ] Deduced a trap composed of 113 places in 318 ms of which 3 ms to minimize.
[2024-05-23 12:10:17] [INFO ] Deduced a trap composed of 87 places in 307 ms of which 4 ms to minimize.
[2024-05-23 12:10:17] [INFO ] Deduced a trap composed of 103 places in 302 ms of which 4 ms to minimize.
[2024-05-23 12:10:17] [INFO ] Deduced a trap composed of 128 places in 293 ms of which 4 ms to minimize.
[2024-05-23 12:10:18] [INFO ] Deduced a trap composed of 103 places in 310 ms of which 6 ms to minimize.
[2024-05-23 12:10:18] [INFO ] Deduced a trap composed of 106 places in 502 ms of which 6 ms to minimize.
[2024-05-23 12:10:19] [INFO ] Deduced a trap composed of 130 places in 509 ms of which 6 ms to minimize.
[2024-05-23 12:10:19] [INFO ] Deduced a trap composed of 115 places in 490 ms of which 6 ms to minimize.
[2024-05-23 12:10:20] [INFO ] Deduced a trap composed of 113 places in 465 ms of which 5 ms to minimize.
[2024-05-23 12:10:20] [INFO ] Deduced a trap composed of 127 places in 490 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/1134 variables, and 63 constraints, problems are : Problem set: 0 solved, 768 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/354 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 37/63 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 12:10:30] [INFO ] Deduced a trap composed of 84 places in 490 ms of which 6 ms to minimize.
[2024-05-23 12:10:31] [INFO ] Deduced a trap composed of 96 places in 507 ms of which 6 ms to minimize.
[2024-05-23 12:10:31] [INFO ] Deduced a trap composed of 93 places in 479 ms of which 6 ms to minimize.
[2024-05-23 12:10:32] [INFO ] Deduced a trap composed of 98 places in 494 ms of which 8 ms to minimize.
[2024-05-23 12:10:32] [INFO ] Deduced a trap composed of 104 places in 432 ms of which 6 ms to minimize.
[2024-05-23 12:10:33] [INFO ] Deduced a trap composed of 98 places in 490 ms of which 6 ms to minimize.
[2024-05-23 12:10:33] [INFO ] Deduced a trap composed of 105 places in 485 ms of which 6 ms to minimize.
[2024-05-23 12:10:34] [INFO ] Deduced a trap composed of 69 places in 485 ms of which 5 ms to minimize.
[2024-05-23 12:10:34] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 6 ms to minimize.
[2024-05-23 12:10:35] [INFO ] Deduced a trap composed of 109 places in 471 ms of which 6 ms to minimize.
[2024-05-23 12:10:35] [INFO ] Deduced a trap composed of 94 places in 490 ms of which 6 ms to minimize.
[2024-05-23 12:10:36] [INFO ] Deduced a trap composed of 95 places in 479 ms of which 6 ms to minimize.
[2024-05-23 12:10:36] [INFO ] Deduced a trap composed of 112 places in 480 ms of which 6 ms to minimize.
[2024-05-23 12:10:37] [INFO ] Deduced a trap composed of 97 places in 470 ms of which 6 ms to minimize.
[2024-05-23 12:10:37] [INFO ] Deduced a trap composed of 123 places in 478 ms of which 6 ms to minimize.
[2024-05-23 12:10:38] [INFO ] Deduced a trap composed of 102 places in 484 ms of which 5 ms to minimize.
[2024-05-23 12:10:38] [INFO ] Deduced a trap composed of 99 places in 487 ms of which 6 ms to minimize.
[2024-05-23 12:10:39] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 5 ms to minimize.
[2024-05-23 12:10:39] [INFO ] Deduced a trap composed of 106 places in 496 ms of which 6 ms to minimize.
[2024-05-23 12:10:40] [INFO ] Deduced a trap composed of 104 places in 492 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-23 12:10:44] [INFO ] Deduced a trap composed of 130 places in 502 ms of which 6 ms to minimize.
[2024-05-23 12:10:45] [INFO ] Deduced a trap composed of 157 places in 509 ms of which 6 ms to minimize.
[2024-05-23 12:10:49] [INFO ] Deduced a trap composed of 155 places in 500 ms of which 6 ms to minimize.
[2024-05-23 12:10:50] [INFO ] Deduced a trap composed of 129 places in 513 ms of which 6 ms to minimize.
[2024-05-23 12:10:51] [INFO ] Deduced a trap composed of 158 places in 516 ms of which 6 ms to minimize.
SMT process timed out in 60887ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 354/650 places, 780/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63335 ms. Remains : 354/650 places, 780/1516 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p1)), true, p2, (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 351 ms.
Product exploration explored 100000 steps with 0 reset in 372 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 126 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[true, true, p2, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37017 steps (8 resets) in 39 ms. (925 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 15 factoid took 147 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 64805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 48 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 12:10:52] [INFO ] Computed 26 invariants in 6 ms
[2024-05-23 12:10:53] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-23 12:10:53] [INFO ] Invariant cache hit.
[2024-05-23 12:10:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:10:55] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
[2024-05-23 12:10:55] [INFO ] Redundant transitions in 10 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 12:10:55] [INFO ] Invariant cache hit.
[2024-05-23 12:10:55] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:11:07] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 6 ms to minimize.
[2024-05-23 12:11:10] [INFO ] Deduced a trap composed of 112 places in 479 ms of which 6 ms to minimize.
[2024-05-23 12:11:11] [INFO ] Deduced a trap composed of 126 places in 484 ms of which 8 ms to minimize.
[2024-05-23 12:11:12] [INFO ] Deduced a trap composed of 121 places in 495 ms of which 6 ms to minimize.
[2024-05-23 12:11:12] [INFO ] Deduced a trap composed of 170 places in 481 ms of which 7 ms to minimize.
[2024-05-23 12:11:13] [INFO ] Deduced a trap composed of 117 places in 473 ms of which 6 ms to minimize.
[2024-05-23 12:11:13] [INFO ] Deduced a trap composed of 83 places in 477 ms of which 6 ms to minimize.
[2024-05-23 12:11:14] [INFO ] Deduced a trap composed of 89 places in 497 ms of which 6 ms to minimize.
[2024-05-23 12:11:14] [INFO ] Deduced a trap composed of 86 places in 493 ms of which 6 ms to minimize.
[2024-05-23 12:11:15] [INFO ] Deduced a trap composed of 94 places in 441 ms of which 5 ms to minimize.
[2024-05-23 12:11:15] [INFO ] Deduced a trap composed of 136 places in 499 ms of which 5 ms to minimize.
[2024-05-23 12:11:16] [INFO ] Deduced a trap composed of 127 places in 448 ms of which 5 ms to minimize.
[2024-05-23 12:11:16] [INFO ] Deduced a trap composed of 79 places in 482 ms of which 6 ms to minimize.
[2024-05-23 12:11:17] [INFO ] Deduced a trap composed of 90 places in 483 ms of which 6 ms to minimize.
[2024-05-23 12:11:17] [INFO ] Deduced a trap composed of 109 places in 466 ms of which 6 ms to minimize.
[2024-05-23 12:11:18] [INFO ] Deduced a trap composed of 119 places in 482 ms of which 6 ms to minimize.
[2024-05-23 12:11:18] [INFO ] Deduced a trap composed of 119 places in 476 ms of which 6 ms to minimize.
[2024-05-23 12:11:19] [INFO ] Deduced a trap composed of 111 places in 495 ms of which 6 ms to minimize.
[2024-05-23 12:11:19] [INFO ] Deduced a trap composed of 117 places in 476 ms of which 5 ms to minimize.
[2024-05-23 12:11:20] [INFO ] Deduced a trap composed of 115 places in 461 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:11:23] [INFO ] Deduced a trap composed of 59 places in 480 ms of which 6 ms to minimize.
[2024-05-23 12:11:26] [INFO ] Deduced a trap composed of 136 places in 473 ms of which 6 ms to minimize.
SMT process timed out in 30972ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33908 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-09
Product exploration explored 100000 steps with 33 reset in 365 ms.
Stack based approach found an accepted trace after 193 steps with 1 reset with depth 128 and stack size 128 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-09 finished in 34404 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((X(p0)||(p1 U (G(!p2) U (p3 U p0))))))'
Support contains 2 out of 650 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 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 650 transition count 1422
Reduce places removed 94 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 118 rules applied. Total rules applied 212 place count 556 transition count 1398
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 236 place count 532 transition count 1398
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 236 place count 532 transition count 1267
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 498 place count 401 transition count 1267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 522 place count 377 transition count 781
Iterating global reduction 3 with 24 rules applied. Total rules applied 546 place count 377 transition count 781
Applied a total of 546 rules in 95 ms. Remains 377 /650 variables (removed 273) and now considering 781/1516 (removed 735) transitions.
// Phase 1: matrix 781 rows 377 cols
[2024-05-23 12:11:27] [INFO ] Computed 26 invariants in 9 ms
[2024-05-23 12:11:27] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-23 12:11:27] [INFO ] Invariant cache hit.
[2024-05-23 12:11:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:11:29] [INFO ] Implicit Places using invariants and state equation in 2060 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
[2024-05-23 12:11:29] [INFO ] Redundant transitions in 7 ms returned []
Running 769 sub problems to find dead transitions.
[2024-05-23 12:11:29] [INFO ] Invariant cache hit.
[2024-05-23 12:11:29] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-05-23 12:11:42] [INFO ] Deduced a trap composed of 117 places in 543 ms of which 6 ms to minimize.
[2024-05-23 12:11:43] [INFO ] Deduced a trap composed of 101 places in 502 ms of which 6 ms to minimize.
[2024-05-23 12:11:47] [INFO ] Deduced a trap composed of 113 places in 541 ms of which 6 ms to minimize.
[2024-05-23 12:11:48] [INFO ] Deduced a trap composed of 85 places in 537 ms of which 6 ms to minimize.
[2024-05-23 12:11:48] [INFO ] Deduced a trap composed of 103 places in 408 ms of which 4 ms to minimize.
[2024-05-23 12:11:49] [INFO ] Deduced a trap composed of 92 places in 535 ms of which 6 ms to minimize.
[2024-05-23 12:11:50] [INFO ] Deduced a trap composed of 96 places in 505 ms of which 6 ms to minimize.
[2024-05-23 12:11:51] [INFO ] Deduced a trap composed of 99 places in 499 ms of which 6 ms to minimize.
[2024-05-23 12:11:51] [INFO ] Deduced a trap composed of 102 places in 519 ms of which 6 ms to minimize.
[2024-05-23 12:11:52] [INFO ] Deduced a trap composed of 123 places in 552 ms of which 6 ms to minimize.
[2024-05-23 12:11:52] [INFO ] Deduced a trap composed of 96 places in 483 ms of which 6 ms to minimize.
[2024-05-23 12:11:53] [INFO ] Deduced a trap composed of 68 places in 417 ms of which 6 ms to minimize.
[2024-05-23 12:11:53] [INFO ] Deduced a trap composed of 123 places in 516 ms of which 6 ms to minimize.
[2024-05-23 12:11:54] [INFO ] Deduced a trap composed of 158 places in 544 ms of which 6 ms to minimize.
[2024-05-23 12:11:54] [INFO ] Deduced a trap composed of 146 places in 543 ms of which 6 ms to minimize.
[2024-05-23 12:11:55] [INFO ] Deduced a trap composed of 100 places in 539 ms of which 6 ms to minimize.
[2024-05-23 12:11:55] [INFO ] Deduced a trap composed of 110 places in 521 ms of which 6 ms to minimize.
[2024-05-23 12:11:56] [INFO ] Deduced a trap composed of 142 places in 524 ms of which 6 ms to minimize.
[2024-05-23 12:11:56] [INFO ] Deduced a trap composed of 135 places in 457 ms of which 3 ms to minimize.
[2024-05-23 12:11:57] [INFO ] Deduced a trap composed of 135 places in 523 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/1158 variables, and 46 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/377 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 769/769 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 769 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-05-23 12:12:05] [INFO ] Deduced a trap composed of 87 places in 526 ms of which 7 ms to minimize.
[2024-05-23 12:12:05] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 4 ms to minimize.
[2024-05-23 12:12:06] [INFO ] Deduced a trap composed of 66 places in 526 ms of which 6 ms to minimize.
[2024-05-23 12:12:06] [INFO ] Deduced a trap composed of 84 places in 516 ms of which 6 ms to minimize.
[2024-05-23 12:12:07] [INFO ] Deduced a trap composed of 63 places in 431 ms of which 4 ms to minimize.
[2024-05-23 12:12:07] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 5 ms to minimize.
[2024-05-23 12:12:08] [INFO ] Deduced a trap composed of 94 places in 420 ms of which 6 ms to minimize.
[2024-05-23 12:12:08] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 6 ms to minimize.
[2024-05-23 12:12:09] [INFO ] Deduced a trap composed of 55 places in 394 ms of which 5 ms to minimize.
[2024-05-23 12:12:09] [INFO ] Deduced a trap composed of 52 places in 517 ms of which 6 ms to minimize.
[2024-05-23 12:12:10] [INFO ] Deduced a trap composed of 126 places in 526 ms of which 6 ms to minimize.
[2024-05-23 12:12:10] [INFO ] Deduced a trap composed of 106 places in 502 ms of which 5 ms to minimize.
[2024-05-23 12:12:11] [INFO ] Deduced a trap composed of 104 places in 426 ms of which 6 ms to minimize.
[2024-05-23 12:12:11] [INFO ] Deduced a trap composed of 85 places in 531 ms of which 6 ms to minimize.
[2024-05-23 12:12:12] [INFO ] Deduced a trap composed of 103 places in 525 ms of which 6 ms to minimize.
[2024-05-23 12:12:13] [INFO ] Deduced a trap composed of 104 places in 532 ms of which 6 ms to minimize.
[2024-05-23 12:12:13] [INFO ] Deduced a trap composed of 104 places in 503 ms of which 6 ms to minimize.
[2024-05-23 12:12:14] [INFO ] Deduced a trap composed of 113 places in 432 ms of which 6 ms to minimize.
[2024-05-23 12:12:14] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 4 ms to minimize.
[2024-05-23 12:12:14] [INFO ] Deduced a trap composed of 113 places in 423 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-05-23 12:12:17] [INFO ] Deduced a trap composed of 65 places in 532 ms of which 6 ms to minimize.
[2024-05-23 12:12:18] [INFO ] Deduced a trap composed of 98 places in 530 ms of which 6 ms to minimize.
[2024-05-23 12:12:25] [INFO ] Deduced a trap composed of 70 places in 547 ms of which 7 ms to minimize.
[2024-05-23 12:12:27] [INFO ] Deduced a trap composed of 153 places in 471 ms of which 6 ms to minimize.
[2024-05-23 12:12:27] [INFO ] Deduced a trap composed of 59 places in 538 ms of which 6 ms to minimize.
[2024-05-23 12:12:28] [INFO ] Deduced a trap composed of 76 places in 546 ms of which 6 ms to minimize.
[2024-05-23 12:12:29] [INFO ] Deduced a trap composed of 56 places in 544 ms of which 7 ms to minimize.
[2024-05-23 12:12:31] [INFO ] Deduced a trap composed of 97 places in 510 ms of which 7 ms to minimize.
SMT process timed out in 61292ms, After SMT, problems are : Problem set: 0 solved, 769 unsolved
Search for dead transitions found 0 dead transitions in 61302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 377/650 places, 781/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64198 ms. Remains : 377/650 places, 781/1516 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 25 reset in 343 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 64640 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(p0))'
Support contains 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 650 transition count 1396
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 530 transition count 1384
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 518 transition count 1384
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 264 place count 518 transition count 1253
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 526 place count 387 transition count 1253
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 551 place count 362 transition count 722
Iterating global reduction 3 with 25 rules applied. Total rules applied 576 place count 362 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 578 place count 361 transition count 721
Applied a total of 578 rules in 104 ms. Remains 361 /650 variables (removed 289) and now considering 721/1516 (removed 795) transitions.
// Phase 1: matrix 721 rows 361 cols
[2024-05-23 12:12:31] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 12:12:32] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-23 12:12:32] [INFO ] Invariant cache hit.
[2024-05-23 12:12:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:12:34] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
[2024-05-23 12:12:34] [INFO ] Redundant transitions in 9 ms returned []
Running 709 sub problems to find dead transitions.
[2024-05-23 12:12:34] [INFO ] Invariant cache hit.
[2024-05-23 12:12:34] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-05-23 12:12:47] [INFO ] Deduced a trap composed of 114 places in 504 ms of which 6 ms to minimize.
[2024-05-23 12:12:49] [INFO ] Deduced a trap composed of 117 places in 542 ms of which 6 ms to minimize.
[2024-05-23 12:12:49] [INFO ] Deduced a trap composed of 94 places in 498 ms of which 6 ms to minimize.
[2024-05-23 12:12:50] [INFO ] Deduced a trap composed of 91 places in 492 ms of which 6 ms to minimize.
[2024-05-23 12:12:52] [INFO ] Deduced a trap composed of 66 places in 496 ms of which 6 ms to minimize.
[2024-05-23 12:12:54] [INFO ] Deduced a trap composed of 141 places in 510 ms of which 6 ms to minimize.
[2024-05-23 12:12:54] [INFO ] Deduced a trap composed of 94 places in 506 ms of which 6 ms to minimize.
[2024-05-23 12:12:55] [INFO ] Deduced a trap composed of 114 places in 448 ms of which 6 ms to minimize.
[2024-05-23 12:12:55] [INFO ] Deduced a trap composed of 144 places in 496 ms of which 6 ms to minimize.
[2024-05-23 12:12:56] [INFO ] Deduced a trap composed of 86 places in 449 ms of which 6 ms to minimize.
[2024-05-23 12:12:56] [INFO ] Deduced a trap composed of 117 places in 507 ms of which 6 ms to minimize.
[2024-05-23 12:12:57] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 5 ms to minimize.
[2024-05-23 12:12:57] [INFO ] Deduced a trap composed of 74 places in 520 ms of which 6 ms to minimize.
[2024-05-23 12:12:58] [INFO ] Deduced a trap composed of 118 places in 522 ms of which 6 ms to minimize.
[2024-05-23 12:12:58] [INFO ] Deduced a trap composed of 61 places in 521 ms of which 6 ms to minimize.
[2024-05-23 12:12:59] [INFO ] Deduced a trap composed of 63 places in 509 ms of which 6 ms to minimize.
[2024-05-23 12:12:59] [INFO ] Deduced a trap composed of 81 places in 497 ms of which 6 ms to minimize.
[2024-05-23 12:13:00] [INFO ] Deduced a trap composed of 62 places in 494 ms of which 6 ms to minimize.
[2024-05-23 12:13:00] [INFO ] Deduced a trap composed of 67 places in 491 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1082 variables, and 44 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1082 variables, and 44 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/709 constraints, Known Traps: 19/19 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60851ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/650 places, 721/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63700 ms. Remains : 361/650 places, 721/1516 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 63 reset in 242 ms.
Stack based approach found an accepted trace after 107 steps with 1 reset with depth 100 and stack size 100 in 2 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 64008 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(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 628 transition count 1076
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 628 transition count 1076
Applied a total of 44 rules in 62 ms. Remains 628 /650 variables (removed 22) and now considering 1076/1516 (removed 440) transitions.
// Phase 1: matrix 1076 rows 628 cols
[2024-05-23 12:13:35] [INFO ] Computed 26 invariants in 12 ms
[2024-05-23 12:13:36] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-23 12:13:36] [INFO ] Invariant cache hit.
[2024-05-23 12:13:37] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:13:45] [INFO ] Implicit Places using invariants and state equation in 8853 ms returned []
Implicit Place search using SMT with State Equation took 9809 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-05-23 12:13:45] [INFO ] Invariant cache hit.
[2024-05-23 12:13:45] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 12:14:06] [INFO ] Deduced a trap composed of 122 places in 631 ms of which 10 ms to minimize.
[2024-05-23 12:14:08] [INFO ] Deduced a trap composed of 163 places in 765 ms of which 9 ms to minimize.
[2024-05-23 12:14:09] [INFO ] Deduced a trap composed of 223 places in 711 ms of which 9 ms to minimize.
[2024-05-23 12:14:10] [INFO ] Deduced a trap composed of 331 places in 703 ms of which 9 ms to minimize.
[2024-05-23 12:14:10] [INFO ] Deduced a trap composed of 172 places in 685 ms of which 6 ms to minimize.
[2024-05-23 12:14:13] [INFO ] Deduced a trap composed of 145 places in 715 ms of which 9 ms to minimize.
[2024-05-23 12:14:14] [INFO ] Deduced a trap composed of 139 places in 663 ms of which 8 ms to minimize.
[2024-05-23 12:14:15] [INFO ] Deduced a trap composed of 278 places in 624 ms of which 6 ms to minimize.
[2024-05-23 12:14:15] [INFO ] Deduced a trap composed of 245 places in 560 ms of which 8 ms to minimize.
[2024-05-23 12:14:16] [INFO ] Deduced a trap composed of 244 places in 666 ms of which 8 ms to minimize.
[2024-05-23 12:14:17] [INFO ] Deduced a trap composed of 217 places in 636 ms of which 8 ms to minimize.
SMT process timed out in 31441ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 31453ms
Starting structural reductions in LTL mode, iteration 1 : 628/650 places, 1076/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41327 ms. Remains : 628/650 places, 1076/1516 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Anderson-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 249 ms.
Product exploration explored 100000 steps with 0 reset in 293 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 (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 1170 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 702 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
[2024-05-23 12:14:19] [INFO ] Invariant cache hit.
[2024-05-23 12:14:19] [INFO ] State equation strengthened by 132 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) 589/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/617 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/628 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 2 solved, 1 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-23 12:14:20] [INFO ] Deduced a trap composed of 560 places in 756 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2742ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 14 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 3 factoid took 355 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 26 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2024-05-23 12:14:22] [INFO ] Invariant cache hit.
[2024-05-23 12:14:23] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-05-23 12:14:23] [INFO ] Invariant cache hit.
[2024-05-23 12:14:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:14:32] [INFO ] Implicit Places using invariants and state equation in 8414 ms returned []
Implicit Place search using SMT with State Equation took 9456 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-05-23 12:14:32] [INFO ] Invariant cache hit.
[2024-05-23 12:14:32] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-05-23 12:14:53] [INFO ] Deduced a trap composed of 122 places in 652 ms of which 10 ms to minimize.
[2024-05-23 12:14:55] [INFO ] Deduced a trap composed of 163 places in 740 ms of which 10 ms to minimize.
[2024-05-23 12:14:55] [INFO ] Deduced a trap composed of 223 places in 720 ms of which 9 ms to minimize.
[2024-05-23 12:14:56] [INFO ] Deduced a trap composed of 331 places in 639 ms of which 7 ms to minimize.
[2024-05-23 12:14:57] [INFO ] Deduced a trap composed of 172 places in 663 ms of which 6 ms to minimize.
[2024-05-23 12:14:59] [INFO ] Deduced a trap composed of 145 places in 722 ms of which 9 ms to minimize.
[2024-05-23 12:15:00] [INFO ] Deduced a trap composed of 139 places in 705 ms of which 6 ms to minimize.
[2024-05-23 12:15:01] [INFO ] Deduced a trap composed of 278 places in 587 ms of which 9 ms to minimize.
[2024-05-23 12:15:02] [INFO ] Deduced a trap composed of 245 places in 762 ms of which 10 ms to minimize.
[2024-05-23 12:15:02] [INFO ] Deduced a trap composed of 244 places in 710 ms of which 6 ms to minimize.
[2024-05-23 12:15:03] [INFO ] Deduced a trap composed of 217 places in 719 ms of which 7 ms to minimize.
[2024-05-23 12:15:04] [INFO ] Deduced a trap composed of 236 places in 807 ms of which 9 ms to minimize.
SMT process timed out in 31967ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 31979ms
Finished structural reductions in LTL mode , in 1 iterations and 41466 ms. Remains : 628/628 places, 1076/1076 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 p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
RANDOM walk for 40000 steps (8 resets) in 808 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-23 12:15:05] [INFO ] Invariant cache hit.
[2024-05-23 12:15:05] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 0 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 12:15:06] [INFO ] Deduced a trap composed of 560 places in 572 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1921 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2936ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 302 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 628 transition count 1076
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 142 place count 628 transition count 1076
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 274 place count 628 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 1 ms
Applied a total of 278 rules in 97 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
[2024-05-23 12:15:10] [INFO ] Redundant transitions in 12 ms returned []
Running 1018 sub problems to find dead transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 12:15:10] [INFO ] Computed 26 invariants in 15 ms
[2024-05-23 12:15:10] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:15:28] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-23 12:15:28] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-23 12:15:29] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-23 12:15:29] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-23 12:15:29] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-23 12:15:29] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:15:30] [INFO ] Deduced a trap composed of 97 places in 751 ms of which 10 ms to minimize.
[2024-05-23 12:15:30] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-23 12:15:31] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-23 12:15:31] [INFO ] Deduced a trap composed of 93 places in 555 ms of which 7 ms to minimize.
[2024-05-23 12:15:32] [INFO ] Deduced a trap composed of 82 places in 561 ms of which 10 ms to minimize.
[2024-05-23 12:15:32] [INFO ] Deduced a trap composed of 26 places in 647 ms of which 10 ms to minimize.
[2024-05-23 12:15:33] [INFO ] Deduced a trap composed of 30 places in 770 ms of which 9 ms to minimize.
[2024-05-23 12:15:34] [INFO ] Deduced a trap composed of 40 places in 789 ms of which 10 ms to minimize.
[2024-05-23 12:15:35] [INFO ] Deduced a trap composed of 69 places in 691 ms of which 6 ms to minimize.
[2024-05-23 12:15:36] [INFO ] Deduced a trap composed of 24 places in 786 ms of which 9 ms to minimize.
[2024-05-23 12:15:37] [INFO ] Deduced a trap composed of 26 places in 810 ms of which 9 ms to minimize.
[2024-05-23 12:15:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-23 12:15:39] [INFO ] Deduced a trap composed of 49 places in 786 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 45 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 19/45 constraints. Problems are: Problem set: 251 solved, 767 unsolved
[2024-05-23 12:15:47] [INFO ] Deduced a trap composed of 170 places in 832 ms of which 9 ms to minimize.
[2024-05-23 12:15:48] [INFO ] Deduced a trap composed of 121 places in 745 ms of which 9 ms to minimize.
[2024-05-23 12:15:49] [INFO ] Deduced a trap composed of 127 places in 795 ms of which 10 ms to minimize.
[2024-05-23 12:15:49] [INFO ] Deduced a trap composed of 104 places in 802 ms of which 10 ms to minimize.
[2024-05-23 12:15:50] [INFO ] Deduced a trap composed of 139 places in 805 ms of which 10 ms to minimize.
[2024-05-23 12:15:51] [INFO ] Deduced a trap composed of 153 places in 529 ms of which 5 ms to minimize.
[2024-05-23 12:15:52] [INFO ] Deduced a trap composed of 148 places in 667 ms of which 9 ms to minimize.
[2024-05-23 12:15:52] [INFO ] Deduced a trap composed of 101 places in 626 ms of which 6 ms to minimize.
[2024-05-23 12:15:53] [INFO ] Deduced a trap composed of 133 places in 526 ms of which 9 ms to minimize.
[2024-05-23 12:15:53] [INFO ] Deduced a trap composed of 100 places in 663 ms of which 10 ms to minimize.
[2024-05-23 12:15:54] [INFO ] Deduced a trap composed of 114 places in 664 ms of which 9 ms to minimize.
[2024-05-23 12:15:55] [INFO ] Deduced a trap composed of 136 places in 638 ms of which 8 ms to minimize.
[2024-05-23 12:15:55] [INFO ] Deduced a trap composed of 117 places in 648 ms of which 9 ms to minimize.
[2024-05-23 12:15:56] [INFO ] Deduced a trap composed of 69 places in 668 ms of which 9 ms to minimize.
[2024-05-23 12:15:57] [INFO ] Deduced a trap composed of 123 places in 643 ms of which 8 ms to minimize.
[2024-05-23 12:15:57] [INFO ] Deduced a trap composed of 89 places in 688 ms of which 9 ms to minimize.
[2024-05-23 12:15:58] [INFO ] Deduced a trap composed of 100 places in 586 ms of which 8 ms to minimize.
[2024-05-23 12:15:59] [INFO ] Deduced a trap composed of 120 places in 670 ms of which 8 ms to minimize.
[2024-05-23 12:15:59] [INFO ] Deduced a trap composed of 118 places in 652 ms of which 7 ms to minimize.
[2024-05-23 12:16:00] [INFO ] Deduced a trap composed of 166 places in 652 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 20/65 constraints. Problems are: Problem set: 251 solved, 767 unsolved
[2024-05-23 12:16:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-23 12:16:04] [INFO ] Deduced a trap composed of 140 places in 713 ms of which 9 ms to minimize.
[2024-05-23 12:16:05] [INFO ] Deduced a trap composed of 148 places in 757 ms of which 9 ms to minimize.
[2024-05-23 12:16:06] [INFO ] Deduced a trap composed of 105 places in 816 ms of which 9 ms to minimize.
[2024-05-23 12:16:07] [INFO ] Deduced a trap composed of 150 places in 794 ms of which 6 ms to minimize.
[2024-05-23 12:16:07] [INFO ] Deduced a trap composed of 119 places in 838 ms of which 10 ms to minimize.
[2024-05-23 12:16:08] [INFO ] Deduced a trap composed of 138 places in 717 ms of which 9 ms to minimize.
[2024-05-23 12:16:09] [INFO ] Deduced a trap composed of 136 places in 702 ms of which 8 ms to minimize.
[2024-05-23 12:16:09] [INFO ] Deduced a trap composed of 141 places in 580 ms of which 6 ms to minimize.
[2024-05-23 12:16:10] [INFO ] Deduced a trap composed of 123 places in 837 ms of which 11 ms to minimize.
[2024-05-23 12:16:11] [INFO ] Deduced a trap composed of 153 places in 729 ms of which 10 ms to minimize.
SMT process timed out in 61404ms, After SMT, problems are : Problem set: 251 solved, 767 unsolved
Search for dead transitions found 251 dead transitions in 61417ms
Found 251 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 251 transitions
Dead transitions reduction (with SMT) removed 251 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 626/628 places, 779/1076 transitions.
Graph (complete) has 2037 edges and 626 vertex of which 375 are kept as prefixes of interest. Removing 251 places using SCC suffix rule.5 ms
Discarding 251 places :
Also discarding 0 output transitions
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 1 rules in 32 ms. Remains 375 /626 variables (removed 251) and now considering 779/779 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 375/628 places, 779/1076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61568 ms. Remains : 375/628 places, 779/1076 transitions.
Built C files in :
/tmp/ltsmin2162790058214479668
[2024-05-23 12:16:11] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2162790058214479668
Running compilation step : cd /tmp/ltsmin2162790058214479668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2162790058214479668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2162790058214479668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1030
Applied a total of 4 rules in 43 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-05-23 12:16:14] [INFO ] Computed 26 invariants in 7 ms
[2024-05-23 12:16:15] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-05-23 12:16:15] [INFO ] Invariant cache hit.
[2024-05-23 12:16:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:16:22] [INFO ] Implicit Places using invariants and state equation in 6333 ms returned []
Implicit Place search using SMT with State Equation took 7414 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-05-23 12:16:22] [INFO ] Invariant cache hit.
[2024-05-23 12:16:22] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:16:46] [INFO ] Deduced a trap composed of 227 places in 697 ms of which 8 ms to minimize.
[2024-05-23 12:16:53] [INFO ] Deduced a trap composed of 217 places in 860 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 28 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:16:58] [INFO ] Deduced a trap composed of 328 places in 714 ms of which 9 ms to minimize.
[2024-05-23 12:16:59] [INFO ] Deduced a trap composed of 257 places in 676 ms of which 6 ms to minimize.
[2024-05-23 12:16:59] [INFO ] Deduced a trap composed of 356 places in 827 ms of which 10 ms to minimize.
[2024-05-23 12:17:00] [INFO ] Deduced a trap composed of 344 places in 782 ms of which 10 ms to minimize.
[2024-05-23 12:17:01] [INFO ] Deduced a trap composed of 173 places in 700 ms of which 9 ms to minimize.
[2024-05-23 12:17:02] [INFO ] Deduced a trap composed of 86 places in 655 ms of which 6 ms to minimize.
[2024-05-23 12:17:02] [INFO ] Deduced a trap composed of 237 places in 838 ms of which 10 ms to minimize.
[2024-05-23 12:17:03] [INFO ] Deduced a trap composed of 215 places in 835 ms of which 9 ms to minimize.
[2024-05-23 12:17:04] [INFO ] Deduced a trap composed of 166 places in 765 ms of which 10 ms to minimize.
[2024-05-23 12:17:05] [INFO ] Deduced a trap composed of 251 places in 654 ms of which 9 ms to minimize.
[2024-05-23 12:17:05] [INFO ] Deduced a trap composed of 147 places in 686 ms of which 6 ms to minimize.
[2024-05-23 12:17:06] [INFO ] Deduced a trap composed of 167 places in 835 ms of which 10 ms to minimize.
[2024-05-23 12:17:07] [INFO ] Deduced a trap composed of 282 places in 767 ms of which 9 ms to minimize.
[2024-05-23 12:17:08] [INFO ] Deduced a trap composed of 337 places in 642 ms of which 10 ms to minimize.
[2024-05-23 12:17:08] [INFO ] Deduced a trap composed of 133 places in 649 ms of which 6 ms to minimize.
[2024-05-23 12:17:09] [INFO ] Deduced a trap composed of 374 places in 711 ms of which 9 ms to minimize.
[2024-05-23 12:17:10] [INFO ] Deduced a trap composed of 266 places in 710 ms of which 10 ms to minimize.
[2024-05-23 12:17:11] [INFO ] Deduced a trap composed of 290 places in 681 ms of which 10 ms to minimize.
[2024-05-23 12:17:12] [INFO ] Deduced a trap composed of 317 places in 844 ms of which 10 ms to minimize.
[2024-05-23 12:17:12] [INFO ] Deduced a trap composed of 325 places in 801 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-05-23 12:17:16] [INFO ] Deduced a trap composed of 238 places in 661 ms of which 6 ms to minimize.
[2024-05-23 12:17:16] [INFO ] Deduced a trap composed of 85 places in 690 ms of which 6 ms to minimize.
[2024-05-23 12:17:18] [INFO ] Deduced a trap composed of 224 places in 774 ms of which 9 ms to minimize.
[2024-05-23 12:17:19] [INFO ] Deduced a trap composed of 348 places in 695 ms of which 9 ms to minimize.
[2024-05-23 12:17:19] [INFO ] Deduced a trap composed of 163 places in 564 ms of which 9 ms to minimize.
[2024-05-23 12:17:20] [INFO ] Deduced a trap composed of 276 places in 665 ms of which 9 ms to minimize.
[2024-05-23 12:17:21] [INFO ] Deduced a trap composed of 125 places in 696 ms of which 6 ms to minimize.
[2024-05-23 12:17:21] [INFO ] Deduced a trap composed of 264 places in 820 ms of which 9 ms to minimize.
[2024-05-23 12:17:22] [INFO ] Deduced a trap composed of 146 places in 742 ms of which 9 ms to minimize.
[2024-05-23 12:17:23] [INFO ] Deduced a trap composed of 282 places in 846 ms of which 9 ms to minimize.
SMT process timed out in 61413ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 61432ms
Starting structural reductions in LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68894 ms. Remains : 626/628 places, 1030/1076 transitions.
Built C files in :
/tmp/ltsmin17199541220295065514
[2024-05-23 12:17:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17199541220295065514
Running compilation step : cd /tmp/ltsmin17199541220295065514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17199541220295065514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17199541220295065514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 12:17:26] [INFO ] Flatten gal took : 55 ms
[2024-05-23 12:17:26] [INFO ] Flatten gal took : 56 ms
[2024-05-23 12:17:26] [INFO ] Time to serialize gal into /tmp/LTL2279967052188586114.gal : 13 ms
[2024-05-23 12:17:26] [INFO ] Time to serialize properties into /tmp/LTL10120582666747930602.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2279967052188586114.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12085123932559289211.hoa' '-atoms' '/tmp/LTL10120582666747930602.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10120582666747930602.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12085123932559289211.hoa
Detected timeout of ITS tools.
[2024-05-23 12:17:42] [INFO ] Flatten gal took : 49 ms
[2024-05-23 12:17:42] [INFO ] Flatten gal took : 61 ms
[2024-05-23 12:17:42] [INFO ] Time to serialize gal into /tmp/LTL2826092561883369797.gal : 18 ms
[2024-05-23 12:17:42] [INFO ] Time to serialize properties into /tmp/LTL8070562233899110930.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2826092561883369797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8070562233899110930.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((F((G("((next_1!=1)||(ncs_0_9!=1))"))||(("(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_8!=1)))")&&(X("((next_1!=1)...216
Formula 0 simplified : XXXF(!"((next_15==0)||(ncs_3_2==0))" | G(F!"((next_1!=1)||(ncs_0_9!=1))" & (!"(((next_12!=1)||(ncs_6_11!=1))||((next_12!=1)||(ncs_3_...200
Detected timeout of ITS tools.
[2024-05-23 12:17:57] [INFO ] Flatten gal took : 39 ms
[2024-05-23 12:17:57] [INFO ] Applying decomposition
[2024-05-23 12:17:57] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1924205332178120169.txt' '-o' '/tmp/graph1924205332178120169.bin' '-w' '/tmp/graph1924205332178120169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1924205332178120169.bin' '-l' '-1' '-v' '-w' '/tmp/graph1924205332178120169.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:17:57] [INFO ] Decomposing Gal with order
[2024-05-23 12:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:17:57] [INFO ] Removed a total of 1916 redundant transitions.
[2024-05-23 12:17:57] [INFO ] Flatten gal took : 265 ms
[2024-05-23 12:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 59 ms.
[2024-05-23 12:17:58] [INFO ] Time to serialize gal into /tmp/LTL7228162303325544681.gal : 25 ms
[2024-05-23 12:17:58] [INFO ] Time to serialize properties into /tmp/LTL5891886448698925255.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7228162303325544681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5891886448698925255.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((F((G("((i0.i0.u0.next_1!=1)||(i2.u183.ncs_0_9!=1))"))||(("(((i0.i0.u5.next_12!=1)||(i1.i0.u218.ncs_6_11!=1))||((i0.i0.u5.n...308
Formula 0 simplified : XXXF(!"((i0.i1.u6.next_15==0)||(i0.i0.u29.ncs_3_2==0))" | G(F!"((i0.i0.u0.next_1!=1)||(i2.u183.ncs_0_9!=1))" & (!"(((i0.i0.u5.next_1...292
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLFireability-12 finished in 277521 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((p0&&G(F(((p2 U p3)&&p1))))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 284 place count 508 transition count 1243
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 758
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 758
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 353 transition count 757
Applied a total of 594 rules in 47 ms. Remains 353 /650 variables (removed 297) and now considering 757/1516 (removed 759) transitions.
// Phase 1: matrix 757 rows 353 cols
[2024-05-23 12:18:13] [INFO ] Computed 26 invariants in 5 ms
[2024-05-23 12:18:14] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-23 12:18:14] [INFO ] Invariant cache hit.
[2024-05-23 12:18:14] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:18:16] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 3106 ms to find 0 implicit places.
[2024-05-23 12:18:16] [INFO ] Redundant transitions in 6 ms returned []
Running 745 sub problems to find dead transitions.
[2024-05-23 12:18:16] [INFO ] Invariant cache hit.
[2024-05-23 12:18:16] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 12:18:27] [INFO ] Deduced a trap composed of 136 places in 398 ms of which 5 ms to minimize.
[2024-05-23 12:18:28] [INFO ] Deduced a trap composed of 127 places in 395 ms of which 4 ms to minimize.
[2024-05-23 12:18:28] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 6 ms to minimize.
[2024-05-23 12:18:28] [INFO ] Deduced a trap composed of 92 places in 403 ms of which 6 ms to minimize.
[2024-05-23 12:18:29] [INFO ] Deduced a trap composed of 108 places in 405 ms of which 6 ms to minimize.
[2024-05-23 12:18:29] [INFO ] Deduced a trap composed of 96 places in 404 ms of which 5 ms to minimize.
[2024-05-23 12:18:30] [INFO ] Deduced a trap composed of 104 places in 404 ms of which 5 ms to minimize.
[2024-05-23 12:18:30] [INFO ] Deduced a trap composed of 70 places in 403 ms of which 5 ms to minimize.
[2024-05-23 12:18:33] [INFO ] Deduced a trap composed of 111 places in 369 ms of which 6 ms to minimize.
[2024-05-23 12:18:34] [INFO ] Deduced a trap composed of 116 places in 404 ms of which 6 ms to minimize.
[2024-05-23 12:18:34] [INFO ] Deduced a trap composed of 111 places in 412 ms of which 5 ms to minimize.
[2024-05-23 12:18:35] [INFO ] Deduced a trap composed of 159 places in 420 ms of which 5 ms to minimize.
[2024-05-23 12:18:35] [INFO ] Deduced a trap composed of 133 places in 414 ms of which 6 ms to minimize.
[2024-05-23 12:18:36] [INFO ] Deduced a trap composed of 165 places in 405 ms of which 6 ms to minimize.
[2024-05-23 12:18:36] [INFO ] Deduced a trap composed of 147 places in 516 ms of which 6 ms to minimize.
[2024-05-23 12:18:37] [INFO ] Deduced a trap composed of 155 places in 404 ms of which 6 ms to minimize.
[2024-05-23 12:18:37] [INFO ] Deduced a trap composed of 159 places in 423 ms of which 7 ms to minimize.
[2024-05-23 12:18:38] [INFO ] Deduced a trap composed of 158 places in 386 ms of which 5 ms to minimize.
[2024-05-23 12:18:38] [INFO ] Deduced a trap composed of 158 places in 409 ms of which 5 ms to minimize.
[2024-05-23 12:18:38] [INFO ] Deduced a trap composed of 199 places in 401 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-23 12:18:45] [INFO ] Deduced a trap composed of 171 places in 496 ms of which 6 ms to minimize.
[2024-05-23 12:18:45] [INFO ] Deduced a trap composed of 94 places in 511 ms of which 6 ms to minimize.
[2024-05-23 12:18:46] [INFO ] Deduced a trap composed of 119 places in 467 ms of which 4 ms to minimize.
[2024-05-23 12:18:46] [INFO ] Deduced a trap composed of 59 places in 493 ms of which 5 ms to minimize.
[2024-05-23 12:18:47] [INFO ] Deduced a trap composed of 76 places in 496 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1110 variables, and 51 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1110 variables, and 51 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 25/25 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 353/650 places, 757/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64093 ms. Remains : 353/650 places, 757/1516 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0), (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 324 ms.
Stack based approach found an accepted trace after 117 steps with 0 reset with depth 118 and stack size 118 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-13 finished in 64664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 58 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 12:19:17] [INFO ] Computed 26 invariants in 8 ms
[2024-05-23 12:19:18] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-23 12:19:18] [INFO ] Invariant cache hit.
[2024-05-23 12:19:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:19:21] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
[2024-05-23 12:19:21] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 12:19:21] [INFO ] Invariant cache hit.
[2024-05-23 12:19:21] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:19:33] [INFO ] Deduced a trap composed of 93 places in 346 ms of which 4 ms to minimize.
[2024-05-23 12:19:33] [INFO ] Deduced a trap composed of 47 places in 474 ms of which 6 ms to minimize.
[2024-05-23 12:19:34] [INFO ] Deduced a trap composed of 103 places in 324 ms of which 6 ms to minimize.
[2024-05-23 12:19:35] [INFO ] Deduced a trap composed of 143 places in 305 ms of which 4 ms to minimize.
[2024-05-23 12:19:35] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 5 ms to minimize.
[2024-05-23 12:19:36] [INFO ] Deduced a trap composed of 101 places in 353 ms of which 3 ms to minimize.
[2024-05-23 12:19:36] [INFO ] Deduced a trap composed of 116 places in 373 ms of which 5 ms to minimize.
[2024-05-23 12:19:36] [INFO ] Deduced a trap composed of 100 places in 362 ms of which 4 ms to minimize.
[2024-05-23 12:19:37] [INFO ] Deduced a trap composed of 89 places in 359 ms of which 4 ms to minimize.
[2024-05-23 12:19:37] [INFO ] Deduced a trap composed of 114 places in 489 ms of which 6 ms to minimize.
[2024-05-23 12:19:38] [INFO ] Deduced a trap composed of 118 places in 377 ms of which 4 ms to minimize.
[2024-05-23 12:19:38] [INFO ] Deduced a trap composed of 119 places in 410 ms of which 3 ms to minimize.
[2024-05-23 12:19:39] [INFO ] Deduced a trap composed of 91 places in 472 ms of which 6 ms to minimize.
[2024-05-23 12:19:39] [INFO ] Deduced a trap composed of 105 places in 481 ms of which 5 ms to minimize.
[2024-05-23 12:19:40] [INFO ] Deduced a trap composed of 125 places in 473 ms of which 5 ms to minimize.
[2024-05-23 12:19:40] [INFO ] Deduced a trap composed of 101 places in 470 ms of which 6 ms to minimize.
[2024-05-23 12:19:41] [INFO ] Deduced a trap composed of 113 places in 399 ms of which 6 ms to minimize.
[2024-05-23 12:19:41] [INFO ] Deduced a trap composed of 103 places in 399 ms of which 5 ms to minimize.
[2024-05-23 12:19:41] [INFO ] Deduced a trap composed of 126 places in 395 ms of which 5 ms to minimize.
[2024-05-23 12:19:42] [INFO ] Deduced a trap composed of 139 places in 402 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:19:50] [INFO ] Deduced a trap composed of 115 places in 486 ms of which 6 ms to minimize.
[2024-05-23 12:19:50] [INFO ] Deduced a trap composed of 113 places in 495 ms of which 6 ms to minimize.
[2024-05-23 12:19:51] [INFO ] Deduced a trap composed of 106 places in 486 ms of which 6 ms to minimize.
[2024-05-23 12:19:51] [INFO ] Deduced a trap composed of 139 places in 421 ms of which 5 ms to minimize.
SMT process timed out in 30819ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34028 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 212 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 776059 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 776059 steps, saw 600144 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-23 12:19:55] [INFO ] Invariant cache hit.
[2024-05-23 12:19:55] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 25 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 793821 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 793821 steps, saw 612113 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2024-05-23 12:20:00] [INFO ] Computed 26 invariants in 13 ms
[2024-05-23 12:20:00] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1309ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 10 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 11 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-05-23 12:20:01] [INFO ] Invariant cache hit.
[2024-05-23 12:20:02] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-23 12:20:02] [INFO ] Invariant cache hit.
[2024-05-23 12:20:02] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:20:03] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2383 ms to find 0 implicit places.
[2024-05-23 12:20:03] [INFO ] Redundant transitions in 5 ms returned []
Running 719 sub problems to find dead transitions.
[2024-05-23 12:20:03] [INFO ] Invariant cache hit.
[2024-05-23 12:20:03] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-23 12:20:16] [INFO ] Deduced a trap composed of 114 places in 283 ms of which 4 ms to minimize.
[2024-05-23 12:20:16] [INFO ] Deduced a trap composed of 95 places in 510 ms of which 6 ms to minimize.
[2024-05-23 12:20:17] [INFO ] Deduced a trap composed of 105 places in 478 ms of which 6 ms to minimize.
[2024-05-23 12:20:17] [INFO ] Deduced a trap composed of 84 places in 470 ms of which 5 ms to minimize.
[2024-05-23 12:20:18] [INFO ] Deduced a trap composed of 143 places in 495 ms of which 6 ms to minimize.
[2024-05-23 12:20:19] [INFO ] Deduced a trap composed of 92 places in 421 ms of which 5 ms to minimize.
[2024-05-23 12:20:20] [INFO ] Deduced a trap composed of 113 places in 351 ms of which 4 ms to minimize.
[2024-05-23 12:20:20] [INFO ] Deduced a trap composed of 104 places in 348 ms of which 4 ms to minimize.
[2024-05-23 12:20:21] [INFO ] Deduced a trap composed of 101 places in 440 ms of which 6 ms to minimize.
[2024-05-23 12:20:21] [INFO ] Deduced a trap composed of 132 places in 396 ms of which 5 ms to minimize.
[2024-05-23 12:20:22] [INFO ] Deduced a trap composed of 107 places in 420 ms of which 6 ms to minimize.
[2024-05-23 12:20:22] [INFO ] Deduced a trap composed of 125 places in 380 ms of which 5 ms to minimize.
[2024-05-23 12:20:22] [INFO ] Deduced a trap composed of 138 places in 461 ms of which 3 ms to minimize.
[2024-05-23 12:20:23] [INFO ] Deduced a trap composed of 83 places in 479 ms of which 7 ms to minimize.
[2024-05-23 12:20:23] [INFO ] Deduced a trap composed of 57 places in 479 ms of which 6 ms to minimize.
[2024-05-23 12:20:24] [INFO ] Deduced a trap composed of 97 places in 481 ms of which 5 ms to minimize.
[2024-05-23 12:20:24] [INFO ] Deduced a trap composed of 147 places in 399 ms of which 5 ms to minimize.
[2024-05-23 12:20:25] [INFO ] Deduced a trap composed of 88 places in 389 ms of which 5 ms to minimize.
[2024-05-23 12:20:25] [INFO ] Deduced a trap composed of 111 places in 374 ms of which 5 ms to minimize.
[2024-05-23 12:20:26] [INFO ] Deduced a trap composed of 109 places in 366 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-23 12:20:30] [INFO ] Deduced a trap composed of 127 places in 414 ms of which 6 ms to minimize.
[2024-05-23 12:20:30] [INFO ] Deduced a trap composed of 98 places in 394 ms of which 6 ms to minimize.
[2024-05-23 12:20:33] [INFO ] Deduced a trap composed of 101 places in 368 ms of which 4 ms to minimize.
[2024-05-23 12:20:33] [INFO ] Deduced a trap composed of 102 places in 505 ms of which 6 ms to minimize.
[2024-05-23 12:20:34] [INFO ] Deduced a trap composed of 72 places in 506 ms of which 6 ms to minimize.
[2024-05-23 12:20:34] [INFO ] Deduced a trap composed of 97 places in 399 ms of which 5 ms to minimize.
[2024-05-23 12:20:35] [INFO ] Deduced a trap composed of 101 places in 487 ms of which 6 ms to minimize.
SMT process timed out in 31216ms, After SMT, problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 31224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33631 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 20 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-05-23 12:20:35] [INFO ] Computed 26 invariants in 6 ms
[2024-05-23 12:20:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:20:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-23 12:20:35] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 23 ms returned sat
[2024-05-23 12:20:35] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:20:35] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:20:35] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 791 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 18 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-05-23 12:20:36] [INFO ] Computed 26 invariants in 7 ms
[2024-05-23 12:20:37] [INFO ] Implicit Places using invariants in 943 ms returned []
[2024-05-23 12:20:37] [INFO ] Invariant cache hit.
[2024-05-23 12:20:37] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:20:39] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned []
Implicit Place search using SMT with State Equation took 3230 ms to find 0 implicit places.
[2024-05-23 12:20:39] [INFO ] Redundant transitions in 7 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 12:20:39] [INFO ] Invariant cache hit.
[2024-05-23 12:20:39] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:20:53] [INFO ] Deduced a trap composed of 93 places in 475 ms of which 6 ms to minimize.
[2024-05-23 12:20:53] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 5 ms to minimize.
[2024-05-23 12:20:54] [INFO ] Deduced a trap composed of 103 places in 469 ms of which 5 ms to minimize.
[2024-05-23 12:20:55] [INFO ] Deduced a trap composed of 143 places in 421 ms of which 5 ms to minimize.
[2024-05-23 12:20:56] [INFO ] Deduced a trap composed of 125 places in 416 ms of which 6 ms to minimize.
[2024-05-23 12:20:56] [INFO ] Deduced a trap composed of 101 places in 471 ms of which 6 ms to minimize.
[2024-05-23 12:20:57] [INFO ] Deduced a trap composed of 116 places in 473 ms of which 5 ms to minimize.
[2024-05-23 12:20:57] [INFO ] Deduced a trap composed of 100 places in 462 ms of which 6 ms to minimize.
[2024-05-23 12:20:57] [INFO ] Deduced a trap composed of 89 places in 469 ms of which 5 ms to minimize.
[2024-05-23 12:20:58] [INFO ] Deduced a trap composed of 114 places in 478 ms of which 6 ms to minimize.
[2024-05-23 12:20:58] [INFO ] Deduced a trap composed of 118 places in 480 ms of which 6 ms to minimize.
[2024-05-23 12:20:59] [INFO ] Deduced a trap composed of 119 places in 402 ms of which 4 ms to minimize.
[2024-05-23 12:20:59] [INFO ] Deduced a trap composed of 91 places in 370 ms of which 4 ms to minimize.
[2024-05-23 12:21:00] [INFO ] Deduced a trap composed of 105 places in 364 ms of which 4 ms to minimize.
[2024-05-23 12:21:00] [INFO ] Deduced a trap composed of 125 places in 372 ms of which 4 ms to minimize.
[2024-05-23 12:21:01] [INFO ] Deduced a trap composed of 101 places in 497 ms of which 6 ms to minimize.
[2024-05-23 12:21:01] [INFO ] Deduced a trap composed of 113 places in 362 ms of which 3 ms to minimize.
[2024-05-23 12:21:01] [INFO ] Deduced a trap composed of 103 places in 507 ms of which 6 ms to minimize.
[2024-05-23 12:21:02] [INFO ] Deduced a trap composed of 126 places in 490 ms of which 5 ms to minimize.
[2024-05-23 12:21:02] [INFO ] Deduced a trap composed of 139 places in 405 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(timeout
s269 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 20/20 constraints]
After SMT, in 60967ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60977ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64241 ms. Remains : 350/350 places, 732/732 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38308 steps (8 resets) in 48 ms. (781 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 338 ms.
Product exploration explored 100000 steps with 0 reset in 440 ms.
Built C files in :
/tmp/ltsmin12700838561012392851
[2024-05-23 12:21:41] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2024-05-23 12:21:41] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:21:41] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2024-05-23 12:21:41] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:21:41] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2024-05-23 12:21:41] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:21:41] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12700838561012392851
Running compilation step : cd /tmp/ltsmin12700838561012392851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12700838561012392851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12700838561012392851;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 13 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-23 12:21:44] [INFO ] Invariant cache hit.
[2024-05-23 12:21:45] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-23 12:21:45] [INFO ] Invariant cache hit.
[2024-05-23 12:21:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:21:47] [INFO ] Implicit Places using invariants and state equation in 2353 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2024-05-23 12:21:47] [INFO ] Redundant transitions in 8 ms returned []
Running 720 sub problems to find dead transitions.
[2024-05-23 12:21:47] [INFO ] Invariant cache hit.
[2024-05-23 12:21:47] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:21:59] [INFO ] Deduced a trap composed of 93 places in 401 ms of which 5 ms to minimize.
[2024-05-23 12:21:59] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 6 ms to minimize.
[2024-05-23 12:22:00] [INFO ] Deduced a trap composed of 103 places in 397 ms of which 9 ms to minimize.
[2024-05-23 12:22:01] [INFO ] Deduced a trap composed of 143 places in 402 ms of which 5 ms to minimize.
[2024-05-23 12:22:02] [INFO ] Deduced a trap composed of 125 places in 488 ms of which 6 ms to minimize.
[2024-05-23 12:22:02] [INFO ] Deduced a trap composed of 101 places in 387 ms of which 4 ms to minimize.
[2024-05-23 12:22:02] [INFO ] Deduced a trap composed of 116 places in 504 ms of which 5 ms to minimize.
[2024-05-23 12:22:03] [INFO ] Deduced a trap composed of 100 places in 440 ms of which 4 ms to minimize.
[2024-05-23 12:22:03] [INFO ] Deduced a trap composed of 89 places in 440 ms of which 4 ms to minimize.
[2024-05-23 12:22:04] [INFO ] Deduced a trap composed of 114 places in 362 ms of which 4 ms to minimize.
[2024-05-23 12:22:04] [INFO ] Deduced a trap composed of 118 places in 488 ms of which 6 ms to minimize.
[2024-05-23 12:22:05] [INFO ] Deduced a trap composed of 119 places in 363 ms of which 4 ms to minimize.
[2024-05-23 12:22:05] [INFO ] Deduced a trap composed of 91 places in 355 ms of which 4 ms to minimize.
[2024-05-23 12:22:05] [INFO ] Deduced a trap composed of 105 places in 348 ms of which 3 ms to minimize.
[2024-05-23 12:22:06] [INFO ] Deduced a trap composed of 125 places in 366 ms of which 3 ms to minimize.
[2024-05-23 12:22:06] [INFO ] Deduced a trap composed of 101 places in 478 ms of which 5 ms to minimize.
[2024-05-23 12:22:07] [INFO ] Deduced a trap composed of 113 places in 375 ms of which 3 ms to minimize.
[2024-05-23 12:22:07] [INFO ] Deduced a trap composed of 103 places in 358 ms of which 5 ms to minimize.
[2024-05-23 12:22:07] [INFO ] Deduced a trap composed of 126 places in 422 ms of which 6 ms to minimize.
[2024-05-23 12:22:08] [INFO ] Deduced a trap composed of 139 places in 467 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-05-23 12:22:16] [INFO ] Deduced a trap composed of 115 places in 485 ms of which 6 ms to minimize.
[2024-05-23 12:22:17] [INFO ] Deduced a trap composed of 113 places in 467 ms of which 5 ms to minimize.
[2024-05-23 12:22:17] [INFO ] Deduced a trap composed of 106 places in 490 ms of which 5 ms to minimize.
[2024-05-23 12:22:18] [INFO ] Deduced a trap composed of 139 places in 479 ms of which 6 ms to minimize.
[2024-05-23 12:22:18] [INFO ] Deduced a trap composed of 85 places in 494 ms of which 6 ms to minimize.
SMT process timed out in 31038ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 31050ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34095 ms. Remains : 350/350 places, 732/732 transitions.
Built C files in :
/tmp/ltsmin7992344092671034216
[2024-05-23 12:22:18] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2024-05-23 12:22:18] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:22:18] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2024-05-23 12:22:18] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:22:19] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2024-05-23 12:22:19] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:22:19] [INFO ] Built C files in 227ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7992344092671034216
Running compilation step : cd /tmp/ltsmin7992344092671034216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7992344092671034216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7992344092671034216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 12:22:22] [INFO ] Flatten gal took : 25 ms
[2024-05-23 12:22:22] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:22:22] [INFO ] Time to serialize gal into /tmp/LTL13426938847616796490.gal : 5 ms
[2024-05-23 12:22:22] [INFO ] Time to serialize properties into /tmp/LTL13725977218240921891.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13426938847616796490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8454256949168899260.hoa' '-atoms' '/tmp/LTL13725977218240921891.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13725977218240921891.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8454256949168899260.hoa
Detected timeout of ITS tools.
[2024-05-23 12:22:37] [INFO ] Flatten gal took : 30 ms
[2024-05-23 12:22:37] [INFO ] Flatten gal took : 25 ms
[2024-05-23 12:22:37] [INFO ] Time to serialize gal into /tmp/LTL14476657459599902878.gal : 5 ms
[2024-05-23 12:22:37] [INFO ] Time to serialize properties into /tmp/LTL6271934028634205166.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14476657459599902878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6271934028634205166.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((next_18==0)||(ncs_9_2==0))"))))
Formula 0 simplified : GF!"((next_18==0)||(ncs_9_2==0))"
Detected timeout of ITS tools.
[2024-05-23 12:22:52] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:22:52] [INFO ] Applying decomposition
[2024-05-23 12:22:52] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6601865414699213430.txt' '-o' '/tmp/graph6601865414699213430.bin' '-w' '/tmp/graph6601865414699213430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6601865414699213430.bin' '-l' '-1' '-v' '-w' '/tmp/graph6601865414699213430.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:22:52] [INFO ] Decomposing Gal with order
[2024-05-23 12:22:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:22:52] [INFO ] Removed a total of 1429 redundant transitions.
[2024-05-23 12:22:52] [INFO ] Flatten gal took : 87 ms
[2024-05-23 12:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 39 ms.
[2024-05-23 12:22:52] [INFO ] Time to serialize gal into /tmp/LTL1695060290041947738.gal : 12 ms
[2024-05-23 12:22:52] [INFO ] Time to serialize properties into /tmp/LTL4616984823246236343.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1695060290041947738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4616984823246236343.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.i0.u14.next_18==0)||(i1.u100.ncs_9_2==0))"))))
Formula 0 simplified : GF!"((i4.i0.u14.next_18==0)||(i1.u100.ncs_9_2==0))"
Detected timeout of ITS tools.
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 229934 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(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-23 12:23:08] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9985063466834616942
[2024-05-23 12:23:08] [INFO ] Too many transitions (1516) to apply POR reductions. Disabling POR matrices.
[2024-05-23 12:23:08] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9985063466834616942
Running compilation step : cd /tmp/ltsmin9985063466834616942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 12:23:08] [INFO ] Applying decomposition
[2024-05-23 12:23:08] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3716950335997184769.txt' '-o' '/tmp/graph3716950335997184769.bin' '-w' '/tmp/graph3716950335997184769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3716950335997184769.bin' '-l' '-1' '-v' '-w' '/tmp/graph3716950335997184769.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:23:08] [INFO ] Decomposing Gal with order
[2024-05-23 12:23:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:23:08] [INFO ] Removed a total of 3291 redundant transitions.
[2024-05-23 12:23:08] [INFO ] Flatten gal took : 105 ms
[2024-05-23 12:23:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 38 ms.
[2024-05-23 12:23:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4576276828010494829.gal : 16 ms
[2024-05-23 12:23:08] [INFO ] Time to serialize properties into /tmp/LTLFireability11600836310216379606.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4576276828010494829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11600836310216379606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X(G(("((i2.u6.next_15==0)||(i6.u30.ncs_3_2==0))")&&(F(((!("(((i1.u5.next_12==1)&&(i1.u202.ncs_6_11==1))&&((i1.u5.next_12==1)&&(...291
Formula 0 simplified : XXXF(!"((i2.u6.next_15==0)||(i6.u30.ncs_3_2==0))" | G(F"((i1.u0.next_1==1)&&(i4.u93.ncs_0_9==1))" & ("(((i1.u5.next_12==1)&&(i1.u202...263
Compilation finished in 6016 ms.
Running link step : cd /tmp/ltsmin9985063466834616942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin9985063466834616942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X([](((LTLAPp0==true)&&<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
LTSmin run took 276248 ms.
FORMULA Anderson-PT-12-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9985063466834616942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9985063466834616942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin9985063466834616942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 12:49:21] [INFO ] Applying decomposition
[2024-05-23 12:49:22] [INFO ] Flatten gal took : 153 ms
[2024-05-23 12:49:22] [INFO ] Decomposing Gal with order
[2024-05-23 12:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:49:22] [INFO ] Removed a total of 1816 redundant transitions.
[2024-05-23 12:49:22] [INFO ] Flatten gal took : 454 ms
[2024-05-23 12:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 95 ms.
[2024-05-23 12:49:22] [INFO ] Time to serialize gal into /tmp/LTLFireability18377654692289281119.gal : 18 ms
[2024-05-23 12:49:22] [INFO ] Time to serialize properties into /tmp/LTLFireability7908350435460081260.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18377654692289281119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7908350435460081260.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((u13.next_18==0)||(u6.ncs_9_2==0))"))))
Formula 0 simplified : GF!"((u13.next_18==0)||(u6.ncs_9_2==0))"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-12"
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-12, 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-171620118400380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 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 ;