Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700250.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K May 18 16:43 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 PolyORBLF-PT-S02J06T08-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717253173716

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:46:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:46:15] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-06-01 14:46:15] [INFO ] Transformed 690 places.
[2024-06-01 14:46:15] [INFO ] Transformed 1434 transitions.
[2024-06-01 14:46:15] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 52 ms.
[2024-06-01 14:46:15] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 14:46:15] [INFO ] Reduced 88 identical enabling conditions.
[2024-06-01 14:46:15] [INFO ] Reduced 32 identical enabling conditions.
[2024-06-01 14:46:15] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 501 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Applied a total of 16 rules in 67 ms. Remains 682 /690 variables (removed 8) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 14:46:15] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 682 cols
[2024-06-01 14:46:16] [INFO ] Computed 54 invariants in 96 ms
[2024-06-01 14:46:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 72 places in 437 ms of which 68 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 200 places in 388 ms of which 6 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 6 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 173 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 353 places in 359 ms of which 5 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 327 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 5 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 334 places in 351 ms of which 5 ms to minimize.
[2024-06-01 14:46:37] [INFO ] Deduced a trap composed of 75 places in 343 ms of which 4 ms to minimize.
[2024-06-01 14:46:37] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:46:38] [INFO ] Deduced a trap composed of 344 places in 293 ms of which 4 ms to minimize.
SMT process timed out in 22288ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 22361ms
[2024-06-01 14:46:38] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-06-01 14:46:38] [INFO ] Invariant cache hit.
[2024-06-01 14:46:38] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 14:46:38] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-06-01 14:46:38] [INFO ] Invariant cache hit.
[2024-06-01 14:46:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:46:43] [INFO ] Implicit Places using invariants and state equation in 4820 ms returned []
Implicit Place search using SMT with State Equation took 5073 ms to find 0 implicit places.
Running 1296 sub problems to find dead transitions.
[2024-06-01 14:46:43] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-06-01 14:46:43] [INFO ] Invariant cache hit.
[2024-06-01 14:46:43] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 72 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 73 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 122 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 176 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 191 places in 395 ms of which 6 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 327 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 377 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 327 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 498 places in 370 ms of which 5 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 361 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 371 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 6 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 359 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:47:04] [INFO ] Deduced a trap composed of 327 places in 387 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 14:47:08] [INFO ] Deduced a trap composed of 387 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:47:09] [INFO ] Deduced a trap composed of 322 places in 358 ms of which 5 ms to minimize.
[2024-06-01 14:47:11] [INFO ] Deduced a trap composed of 75 places in 348 ms of which 5 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 81 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1964 variables, and 75 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/682 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 25/75 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 14:47:30] [INFO ] Deduced a trap composed of 373 places in 393 ms of which 6 ms to minimize.
[2024-06-01 14:47:30] [INFO ] Deduced a trap composed of 381 places in 410 ms of which 5 ms to minimize.
[2024-06-01 14:47:31] [INFO ] Deduced a trap composed of 393 places in 427 ms of which 5 ms to minimize.
[2024-06-01 14:47:32] [INFO ] Deduced a trap composed of 369 places in 413 ms of which 5 ms to minimize.
[2024-06-01 14:47:32] [INFO ] Deduced a trap composed of 370 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:47:34] [INFO ] Deduced a trap composed of 423 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 368 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 368 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:47:35] [INFO ] Deduced a trap composed of 355 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:47:36] [INFO ] Deduced a trap composed of 457 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:47:36] [INFO ] Deduced a trap composed of 346 places in 308 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/1964 variables, and 86 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/682 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 36/36 constraints]
After SMT, in 62194ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 62213ms
Starting structural reductions in LTL mode, iteration 1 : 682/690 places, 1298/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89770 ms. Remains : 682/690 places, 1298/1306 transitions.
Support contains 501 out of 682 places after structural reductions.
[2024-06-01 14:47:46] [INFO ] Flatten gal took : 216 ms
[2024-06-01 14:47:46] [INFO ] Flatten gal took : 129 ms
[2024-06-01 14:47:46] [INFO ] Input system was already deterministic with 1298 transitions.
Reduction of identical properties reduced properties to check from 83 to 82
RANDOM walk for 40000 steps (13 resets) in 2678 ms. (14 steps per ms) remains 25/82 properties
BEST_FIRST walk for 4002 steps (8 resets) in 154 ms. (25 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (9 resets) in 67 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 154 ms. (25 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
[2024-06-01 14:47:48] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-06-01 14:47:48] [INFO ] Invariant cache hit.
[2024-06-01 14:47:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 151/400 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 2/402 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 6 (OVERLAPS) 277/679 variables, 42/52 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 0/52 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/680 variables, 1/53 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/680 variables, 0/53 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1282/1962 variables, 680/733 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1962 variables, 96/829 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 0/829 constraints. Problems are: Problem set: 19 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/1964 variables, 2/831 constraints. Problems are: Problem set: 19 solved, 6 unsolved
SMT process timed out in 5330ms, After SMT, problems are : Problem set: 19 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 680 transition count 1258
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 640 transition count 1250
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 632 transition count 1250
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 98 place count 632 transition count 1170
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 258 place count 552 transition count 1170
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 398 place count 482 transition count 1100
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 414 place count 482 transition count 1084
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 430 place count 466 transition count 1084
Applied a total of 430 rules in 257 ms. Remains 466 /682 variables (removed 216) and now considering 1084/1298 (removed 214) transitions.
Running 1082 sub problems to find dead transitions.
[2024-06-01 14:47:53] [INFO ] Flow matrix only has 1068 transitions (discarded 16 similar events)
// Phase 1: matrix 1068 rows 466 cols
[2024-06-01 14:47:53] [INFO ] Computed 52 invariants in 39 ms
[2024-06-01 14:47:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 11 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 176 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 144 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:48:07] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:48:07] [INFO ] Deduced a trap composed of 157 places in 214 ms of which 2 ms to minimize.
[2024-06-01 14:48:07] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 151 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:48:09] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 204 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:48:14] [INFO ] Deduced a trap composed of 209 places in 280 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.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 (/ 1.0 2.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 (/ 17.0 2.0))
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 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 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 1.0 2.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 1.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 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 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 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 5.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.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 2.0)
(s210 0.0)
(s211 1.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 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 9.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 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 (/ 1.0 2.0))
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 timeout
0.0)
(s353 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1534 variables, and 70 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/466 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 14:48:27] [INFO ] Deduced a trap composed of 279 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 192 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:48:29] [INFO ] Deduced a trap composed of 153 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/1534 variables, and 73 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/466 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1082 constraints, Known Traps: 23/23 constraints]
After SMT, in 42624ms problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 42640ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42901 ms. Remains : 466/682 places, 1084/1298 transitions.
RANDOM walk for 40001 steps (17 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 99422 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 6
Probabilistic random walk after 99422 steps, saw 60405 distinct states, run finished after 3010 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 14:48:40] [INFO ] Flow matrix only has 1068 transitions (discarded 16 similar events)
[2024-06-01 14:48:40] [INFO ] Invariant cache hit.
[2024-06-01 14:48:40] [INFO ] State equation strengthened by 96 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 338/427 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/438 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 26/464 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:40] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:48:40] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:48:40] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:48:40] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:48:41] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:48:41] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1068/1532 variables, 464/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1532 variables, 96/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1532 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/1534 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1534 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1534 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1534 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1534/1534 variables, and 620 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6160 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 466/466 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 338/427 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:46] [INFO ] Deduced a trap composed of 277 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 279 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 279 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 293 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:48:47] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 218 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 215 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 215 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:48:48] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 231 places in 243 ms of which 2 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 234 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 227 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 5 ms to minimize.
[2024-06-01 14:48:49] [INFO ] Deduced a trap composed of 215 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 215 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 238 places in 175 ms of which 7 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 220 places in 255 ms of which 4 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 221 places in 236 ms of which 2 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 199 places in 221 ms of which 2 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 11/438 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 26/464 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:52] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:52] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:48:53] [INFO ] Deduced a trap composed of 153 places in 269 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1068/1532 variables, 464/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1532 variables, 96/642 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1532 variables, 6/648 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1532/1534 variables, and 648 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 464/466 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 31/31 constraints]
After SMT, in 51226ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1084/1084 transitions.
Applied a total of 0 rules in 56 ms. Remains 466 /466 variables (removed 0) and now considering 1084/1084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 466/466 places, 1084/1084 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 1084/1084 transitions.
Applied a total of 0 rules in 41 ms. Remains 466 /466 variables (removed 0) and now considering 1084/1084 (removed 0) transitions.
[2024-06-01 14:49:31] [INFO ] Flow matrix only has 1068 transitions (discarded 16 similar events)
[2024-06-01 14:49:31] [INFO ] Invariant cache hit.
[2024-06-01 14:49:31] [INFO ] Implicit Places using invariants in 495 ms returned [44, 118, 197, 235, 315, 332, 389, 395]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 501 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 458/466 places, 1084/1084 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 454 transition count 1080
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 454 transition count 1080
Applied a total of 8 rules in 72 ms. Remains 454 /458 variables (removed 4) and now considering 1080/1084 (removed 4) transitions.
[2024-06-01 14:49:31] [INFO ] Flow matrix only has 1064 transitions (discarded 16 similar events)
// Phase 1: matrix 1064 rows 454 cols
[2024-06-01 14:49:32] [INFO ] Computed 44 invariants in 40 ms
[2024-06-01 14:49:32] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 14:49:32] [INFO ] Flow matrix only has 1064 transitions (discarded 16 similar events)
[2024-06-01 14:49:32] [INFO ] Invariant cache hit.
[2024-06-01 14:49:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:40] [INFO ] Implicit Places using invariants and state equation in 8505 ms returned []
Implicit Place search using SMT with State Equation took 9009 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 454/466 places, 1080/1084 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9626 ms. Remains : 454/466 places, 1080/1084 transitions.
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
[2024-06-01 14:49:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 14:49:41] [INFO ] Flatten gal took : 59 ms
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:49:41] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:49:41] [INFO ] Input system was already deterministic with 1298 transitions.
Support contains 356 out of 682 places (down from 360) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Applied a total of 2 rules in 10 ms. Remains 680 /682 variables (removed 2) and now considering 1298/1298 (removed 0) transitions.
Running 1296 sub problems to find dead transitions.
[2024-06-01 14:49:41] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-06-01 14:49:41] [INFO ] Computed 52 invariants in 17 ms
[2024-06-01 14:49:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:49:54] [INFO ] Deduced a trap composed of 72 places in 357 ms of which 5 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:49:55] [INFO ] Deduced a trap composed of 73 places in 362 ms of which 4 ms to minimize.
[2024-06-01 14:49:56] [INFO ] Deduced a trap composed of 167 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:49:56] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:49:56] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:49:56] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:49:57] [INFO ] Deduced a trap composed of 359 places in 373 ms of which 5 ms to minimize.
[2024-06-01 14:49:57] [INFO ] Deduced a trap composed of 327 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:49:58] [INFO ] Deduced a trap composed of 352 places in 417 ms of which 5 ms to minimize.
[2024-06-01 14:49:58] [INFO ] Deduced a trap composed of 372 places in 416 ms of which 5 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 379 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 370 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 352 places in 359 ms of which 5 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 4 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 327 places in 416 ms of which 7 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/1962 variables, and 69 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/1962 variables, and 69 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/680 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 19/19 constraints]
After SMT, in 41711ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41723ms
Finished structural reductions in LTL mode , in 1 iterations and 41738 ms. Remains : 680/682 places, 1298/1298 transitions.
[2024-06-01 14:50:23] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:50:23] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:50:23] [INFO ] Input system was already deterministic with 1298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 64 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:50:23] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:50:23] [INFO ] Computed 52 invariants in 32 ms
[2024-06-01 14:50:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:50:36] [INFO ] Deduced a trap composed of 72 places in 376 ms of which 5 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 5 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 162 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:50:37] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 355 places in 405 ms of which 4 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 351 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:50:39] [INFO ] Deduced a trap composed of 326 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:50:40] [INFO ] Deduced a trap composed of 460 places in 393 ms of which 5 ms to minimize.
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 367 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 331 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:50:43] [INFO ] Deduced a trap composed of 392 places in 379 ms of which 5 ms to minimize.
[2024-06-01 14:50:43] [INFO ] Deduced a trap composed of 372 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:50:44] [INFO ] Deduced a trap composed of 275 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints]
After SMT, in 41715ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41734ms
Finished structural reductions in LTL mode , in 1 iterations and 41802 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:51:05] [INFO ] Flatten gal took : 86 ms
[2024-06-01 14:51:05] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:51:05] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 674 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 674 transition count 1290
Applied a total of 16 rules in 44 ms. Remains 674 /682 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:51:05] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 674 cols
[2024-06-01 14:51:05] [INFO ] Computed 54 invariants in 31 ms
[2024-06-01 14:51:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 333 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 327 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 326 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 319 places in 384 ms of which 32 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:51:21] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:51:23] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 114 places in 219 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1948 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/40 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:51:42] [INFO ] Deduced a trap composed of 300 places in 359 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1948 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/40 constraints, State Equation: 0/674 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 42195ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42210ms
Finished structural reductions in LTL mode , in 1 iterations and 42259 ms. Remains : 674/682 places, 1290/1298 transitions.
[2024-06-01 14:51:47] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:51:47] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:51:47] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 54 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:51:47] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:51:48] [INFO ] Computed 52 invariants in 21 ms
[2024-06-01 14:51:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 72 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 355 places in 365 ms of which 5 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 351 places in 307 ms of which 5 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 326 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 460 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 367 places in 336 ms of which 5 ms to minimize.
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 331 places in 314 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 65 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:52:27] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 17/17 constraints]
After SMT, in 42105ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42127ms
Finished structural reductions in LTL mode , in 1 iterations and 42200 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:52:30] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:52:30] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:52:30] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 680 transition count 1266
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 648 transition count 1258
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 640 transition count 1258
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 80 place count 640 transition count 1170
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 256 place count 552 transition count 1170
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 368 place count 496 transition count 1114
Applied a total of 368 rules in 89 ms. Remains 496 /682 variables (removed 186) and now considering 1114/1298 (removed 184) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:52:30] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 496 cols
[2024-06-01 14:52:30] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 14:52:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:52:40] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 204 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 174 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:52:44] [INFO ] Deduced a trap composed of 83 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:52:46] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:52:46] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:52:46] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:52:49] [INFO ] Deduced a trap composed of 208 places in 315 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1594 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 193 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:53:04] [INFO ] Deduced a trap composed of 308 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/1594 variables, and 69 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/496 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 19/19 constraints]
After SMT, in 41908ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41921ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42013 ms. Remains : 496/682 places, 1114/1298 transitions.
[2024-06-01 14:53:12] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:53:12] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:53:12] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 16 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:53:12] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:53:12] [INFO ] Computed 52 invariants in 35 ms
[2024-06-01 14:53:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 72 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 162 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 355 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 351 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 326 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 460 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:53:31] [INFO ] Deduced a trap composed of 367 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:53:31] [INFO ] Deduced a trap composed of 331 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:53:32] [INFO ] Deduced a trap composed of 392 places in 334 ms of which 3 ms to minimize.
[2024-06-01 14:53:32] [INFO ] Deduced a trap composed of 372 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:53:33] [INFO ] Deduced a trap composed of 275 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints]
After SMT, in 41675ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41695ms
Finished structural reductions in LTL mode , in 1 iterations and 41713 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:53:54] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:53:54] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:53:54] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 18 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:53:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:53:54] [INFO ] Invariant cache hit.
[2024-06-01 14:53:54] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 316 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 123 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:54:09] [INFO ] Deduced a trap composed of 369 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:54:09] [INFO ] Deduced a trap composed of 374 places in 235 ms of which 4 ms to minimize.
[2024-06-01 14:54:09] [INFO ] Deduced a trap composed of 351 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:54:10] [INFO ] Deduced a trap composed of 326 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:54:10] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:54:11] [INFO ] Deduced a trap composed of 364 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:54:11] [INFO ] Deduced a trap composed of 337 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:54:28] [INFO ] Deduced a trap composed of 395 places in 397 ms of which 5 ms to minimize.
[2024-06-01 14:54:29] [INFO ] Deduced a trap composed of 392 places in 318 ms of which 5 ms to minimize.
[2024-06-01 14:54:34] [INFO ] Deduced a trap composed of 312 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 431 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 471 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 431 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:54:35] [INFO ] Deduced a trap composed of 372 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:54:36] [INFO ] Deduced a trap composed of 353 places in 316 ms of which 3 ms to minimize.
SMT process timed out in 41882ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41893ms
Finished structural reductions in LTL mode , in 1 iterations and 41913 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:54:36] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:54:36] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:54:36] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 13 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:54:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:54:36] [INFO ] Invariant cache hit.
[2024-06-01 14:54:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 316 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 123 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 3 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 3 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 369 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 374 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 351 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:54:51] [INFO ] Deduced a trap composed of 326 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 364 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 337 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 70 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:55:11] [INFO ] Deduced a trap composed of 395 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:55:11] [INFO ] Deduced a trap composed of 392 places in 282 ms of which 5 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 312 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 431 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 471 places in 281 ms of which 3 ms to minimize.
SMT process timed out in 41642ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41653ms
Finished structural reductions in LTL mode , in 1 iterations and 41669 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:55:18] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:55:18] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:55:18] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 673 transition count 1291
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 673 transition count 1291
Applied a total of 16 rules in 16 ms. Remains 673 /682 variables (removed 9) and now considering 1291/1298 (removed 7) transitions.
Running 1289 sub problems to find dead transitions.
[2024-06-01 14:55:18] [INFO ] Flow matrix only has 1275 transitions (discarded 16 similar events)
// Phase 1: matrix 1275 rows 673 cols
[2024-06-01 14:55:18] [INFO ] Computed 52 invariants in 15 ms
[2024-06-01 14:55:18] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/671 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 0 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 5 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 305 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:55:33] [INFO ] Deduced a trap composed of 327 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:55:34] [INFO ] Deduced a trap composed of 363 places in 386 ms of which 4 ms to minimize.
[2024-06-01 14:55:34] [INFO ] Deduced a trap composed of 335 places in 320 ms of which 5 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 364 places in 368 ms of which 5 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 367 places in 347 ms of which 5 ms to minimize.
[2024-06-01 14:55:35] [INFO ] Deduced a trap composed of 381 places in 241 ms of which 4 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 380 places in 512 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1948 variables, and 70 constraints, problems are : Problem set: 0 solved, 1289 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/673 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1289/1289 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/671 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1948 variables, and 70 constraints, problems are : Problem set: 0 solved, 1289 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/673 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1289 constraints, Known Traps: 20/20 constraints]
After SMT, in 41526ms problems are : Problem set: 0 solved, 1289 unsolved
Search for dead transitions found 0 dead transitions in 41537ms
Finished structural reductions in LTL mode , in 1 iterations and 41557 ms. Remains : 673/682 places, 1291/1298 transitions.
[2024-06-01 14:55:59] [INFO ] Flatten gal took : 66 ms
[2024-06-01 14:55:59] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:56:00] [INFO ] Input system was already deterministic with 1291 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 680 transition count 1242
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 624 transition count 1242
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 112 place count 624 transition count 1163
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 270 place count 545 transition count 1163
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 414 place count 473 transition count 1091
Applied a total of 414 rules in 77 ms. Remains 473 /682 variables (removed 209) and now considering 1091/1298 (removed 207) transitions.
Running 1089 sub problems to find dead transitions.
[2024-06-01 14:56:00] [INFO ] Flow matrix only has 1075 transitions (discarded 16 similar events)
// Phase 1: matrix 1075 rows 473 cols
[2024-06-01 14:56:00] [INFO ] Computed 52 invariants in 20 ms
[2024-06-01 14:56:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:56:09] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:56:09] [INFO ] Deduced a trap composed of 180 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:56:09] [INFO ] Deduced a trap composed of 159 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:56:09] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:56:09] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 189 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 160 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:56:12] [INFO ] Deduced a trap composed of 87 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 79 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:56:17] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:56:19] [INFO ] Deduced a trap composed of 193 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:56:20] [INFO ] Deduced a trap composed of 194 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 212 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 210 places in 308 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/1548 variables, and 70 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/473 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1089/1089 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1089 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1089 unsolved
[2024-06-01 14:56:36] [INFO ] Deduced a trap composed of 293 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:56:39] [INFO ] Deduced a trap composed of 308 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 301 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 308 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 302 places in 305 ms of which 3 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 286 places in 275 ms of which 4 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 287 places in 277 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/1548 variables, and 77 constraints, problems are : Problem set: 0 solved, 1089 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/473 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1089 constraints, Known Traps: 27/27 constraints]
After SMT, in 41756ms problems are : Problem set: 0 solved, 1089 unsolved
Search for dead transitions found 0 dead transitions in 41773ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41855 ms. Remains : 473/682 places, 1091/1298 transitions.
[2024-06-01 14:56:41] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:56:42] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:56:42] [INFO ] Input system was already deterministic with 1091 transitions.
RANDOM walk for 3375 steps (1 resets) in 31 ms. (105 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 20 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:56:42] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:56:42] [INFO ] Computed 52 invariants in 28 ms
[2024-06-01 14:56:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 72 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 72 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 355 places in 365 ms of which 5 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 351 places in 339 ms of which 5 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 326 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 460 places in 356 ms of which 4 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 367 places in 389 ms of which 5 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 331 places in 400 ms of which 4 ms to minimize.
[2024-06-01 14:57:03] [INFO ] Deduced a trap composed of 392 places in 382 ms of which 4 ms to minimize.
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 372 places in 350 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 116 places in 384 ms of which 5 ms to minimize.
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 Int declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 19/19 constraints]
After SMT, in 42229ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42246ms
Finished structural reductions in LTL mode , in 1 iterations and 42270 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:57:24] [INFO ] Flatten gal took : 48 ms
[2024-06-01 14:57:24] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:57:24] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 22 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:57:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-06-01 14:57:24] [INFO ] Invariant cache hit.
[2024-06-01 14:57:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 316 places in 337 ms of which 4 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 123 places in 326 ms of which 5 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 162 places in 296 ms of which 5 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:57:40] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:57:40] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:57:40] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:57:40] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:57:41] [INFO ] Deduced a trap composed of 369 places in 396 ms of which 5 ms to minimize.
[2024-06-01 14:57:41] [INFO ] Deduced a trap composed of 374 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:57:42] [INFO ] Deduced a trap composed of 351 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:57:42] [INFO ] Deduced a trap composed of 326 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:57:43] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:57:44] [INFO ] Deduced a trap composed of 364 places in 401 ms of which 5 ms to minimize.
[2024-06-01 14:57:44] [INFO ] Deduced a trap composed of 337 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:57:46] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1946 variables, and 69 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 349 places in 415 ms of which 5 ms to minimize.
SMT process timed out in 42132ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42149ms
Finished structural reductions in LTL mode , in 1 iterations and 42177 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:58:06] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:58:06] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:58:07] [INFO ] Input system was already deterministic with 1290 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 680 transition count 1242
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 624 transition count 1242
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 624 transition count 1162
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 272 place count 544 transition count 1162
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 416 place count 472 transition count 1090
Applied a total of 416 rules in 77 ms. Remains 472 /682 variables (removed 210) and now considering 1090/1298 (removed 208) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 14:58:07] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2024-06-01 14:58:07] [INFO ] Computed 52 invariants in 21 ms
[2024-06-01 14:58:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:58:16] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 158 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:58:17] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 80 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 73 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:58:25] [INFO ] Deduced a trap composed of 213 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 212 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 203 places in 213 ms of which 4 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 187 places in 277 ms of which 2 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 216 places in 295 ms of which 3 ms to minimize.
SMT process timed out in 22269ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 22285ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22366 ms. Remains : 472/682 places, 1090/1298 transitions.
[2024-06-01 14:58:29] [INFO ] Flatten gal took : 41 ms
[2024-06-01 14:58:29] [INFO ] Flatten gal took : 75 ms
[2024-06-01 14:58:29] [INFO ] Input system was already deterministic with 1090 transitions.
RANDOM walk for 8365 steps (8 resets) in 76 ms. (108 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S02J06T08-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1298/1298 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1290
Applied a total of 18 rules in 34 ms. Remains 672 /682 variables (removed 10) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-06-01 14:58:29] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 672 cols
[2024-06-01 14:58:29] [INFO ] Computed 52 invariants in 18 ms
[2024-06-01 14:58:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-06-01 14:58:44] [INFO ] Deduced a trap composed of 72 places in 341 ms of which 5 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 72 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:58:45] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 355 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:58:46] [INFO ] Deduced a trap composed of 351 places in 377 ms of which 8 ms to minimize.
[2024-06-01 14:58:47] [INFO ] Deduced a trap composed of 326 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:58:47] [INFO ] Deduced a trap composed of 460 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:58:48] [INFO ] Deduced a trap composed of 367 places in 408 ms of which 5 ms to minimize.
[2024-06-01 14:58:49] [INFO ] Deduced a trap composed of 331 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 392 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:58:50] [INFO ] Deduced a trap composed of 372 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:58:51] [INFO ] Deduced a trap composed of 275 places in 199 ms of which 3 ms to minimize.
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 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1946 variables, and 68 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints]
After SMT, in 42237ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42259ms
Finished structural reductions in LTL mode , in 1 iterations and 42297 ms. Remains : 672/682 places, 1290/1298 transitions.
[2024-06-01 14:59:11] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:59:12] [INFO ] Flatten gal took : 47 ms
[2024-06-01 14:59:12] [INFO ] Input system was already deterministic with 1290 transitions.
[2024-06-01 14:59:12] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:59:12] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:59:12] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2024-06-01 14:59:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 1298 transitions and 5652 arcs took 11 ms.
Total runtime 777227 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J06T08-CTLFireability-2024-14

BK_STOP 1717253952920

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1872/ctl_0_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1872/ctl_1_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1872/ctl_2_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1872/ctl_3_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1872/ctl_4_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1872/ctl_5_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1872/ctl_6_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1872/ctl_7_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1872/ctl_8_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1872/ctl_9_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1872/ctl_10_
ctl formula name PolyORBLF-PT-S02J06T08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1872/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;