Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631133100633.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DoubleLock-PT-p3s2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2023-12
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2023-14
FORMULA_NAME DoubleLock-PT-p3s2-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717202644132

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:44:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:44:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:44:05] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 00:44:05] [INFO ] Transformed 112 places.
[2024-06-01 00:44:05] [INFO ] Transformed 744 transitions.
[2024-06-01 00:44:05] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 32 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Applied a total of 0 rules in 17 ms. Remains 92 /92 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-06-01 00:44:05] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 92 cols
[2024-06-01 00:44:05] [INFO ] Computed 4 invariants in 13 ms
[2024-06-01 00:44:05] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 00:44:05] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-06-01 00:44:05] [INFO ] Invariant cache hit.
[2024-06-01 00:44:05] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 00:44:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-06-01 00:44:06] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-06-01 00:44:06] [INFO ] Invariant cache hit.
[2024-06-01 00:44:06] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-01 00:44:11] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 13 ms to minimize.
Problem TDEAD464 is UNSAT
[2024-06-01 00:44:11] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/6 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 515/606 variables, 91/97 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 47/144 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/144 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 10 (OVERLAPS) 1/607 variables, 1/145 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/145 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 12 (OVERLAPS) 0/607 variables, 0/145 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 145 constraints, problems are : Problem set: 144 solved, 566 unsolved in 29269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 144 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 9/90 variables, 2/3 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/6 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 515/606 variables, 91/97 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 47/144 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 32/176 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/176 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 11 (OVERLAPS) 1/607 variables, 1/177 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/607 variables, 534/711 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/607 variables, 0/711 constraints. Problems are: Problem set: 144 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/607 variables, and 711 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 566/710 constraints, Known Traps: 2/2 constraints]
After SMT, in 60127ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 60155ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 568/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 568
Applied a total of 3 rules in 7 ms. Remains 89 /92 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-06-01 00:45:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 89 cols
[2024-06-01 00:45:06] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 00:45:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 00:45:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-06-01 00:45:06] [INFO ] Invariant cache hit.
[2024-06-01 00:45:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 00:45:06] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/92 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60879 ms. Remains : 89/92 places, 568/712 transitions.
Support contains 59 out of 89 places after structural reductions.
[2024-06-01 00:45:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 00:45:06] [INFO ] Flatten gal took : 64 ms
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:45:06] [INFO ] Flatten gal took : 36 ms
[2024-06-01 00:45:06] [INFO ] Input system was already deterministic with 568 transitions.
Support contains 56 out of 89 places (down from 59) after GAL structural reductions.
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40013 steps (475 resets) in 1598 ms. (25 steps per ms) remains 28/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
[2024-06-01 00:45:07] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-06-01 00:45:07] [INFO ] Invariant cache hit.
[2024-06-01 00:45:07] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/66 variables, 3/3 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 386/452 variables, 66/69 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 40/109 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/109 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 26/478 variables, 23/132 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/133 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/133 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/133 constraints. Problems are: Problem set: 24 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 133 constraints, problems are : Problem set: 24 solved, 4 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 3/3 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 350/423 variables, 49/52 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/53 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 3/56 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/56 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 18/441 variables, 2/58 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 8/66 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/66 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 37/478 variables, 29/95 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 1/96 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 40/136 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 1/137 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/137 constraints. Problems are: Problem set: 24 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/478 variables, 0/137 constraints. Problems are: Problem set: 24 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 137 constraints, problems are : Problem set: 24 solved, 4 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 685ms problems are : Problem set: 24 solved, 4 unsolved
Parikh walk visited 2 properties in 687 ms.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 568/568 transitions.
Graph (complete) has 968 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 81 transition count 560
Applied a total of 9 rules in 29 ms. Remains 81 /89 variables (removed 8) and now considering 560/568 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 81/89 places, 560/568 transitions.
RANDOM walk for 40009 steps (470 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (91 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (101 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 513369 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 2
Probabilistic random walk after 513369 steps, saw 355907 distinct states, run finished after 3004 ms. (steps per millisecond=170 ) properties seen :0
[2024-06-01 00:45:12] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
// Phase 1: matrix 381 rows 81 cols
[2024-06-01 00:45:12] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 00:45:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 322/357 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/391 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 71/462 variables, 46/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 322/357 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/391 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 71/462 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 41/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 18 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 81/81 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 560/560 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2024-06-01 00:45:12] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-06-01 00:45:12] [INFO ] Invariant cache hit.
[2024-06-01 00:45:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 00:45:12] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-06-01 00:45:12] [INFO ] Invariant cache hit.
[2024-06-01 00:45:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 00:45:12] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-06-01 00:45:12] [INFO ] Redundant transitions in 31 ms returned []
Running 558 sub problems to find dead transitions.
[2024-06-01 00:45:12] [INFO ] Flow matrix only has 381 transitions (discarded 179 similar events)
[2024-06-01 00:45:12] [INFO ] Invariant cache hit.
[2024-06-01 00:45:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 0/462 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 124 constraints, problems are : Problem set: 0 solved, 558 unsolved in 9454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 381/462 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 558/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 682 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 39937ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 39944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40243 ms. Remains : 81/81 places, 560/560 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 81 transition count 381
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 179 place count 81 transition count 372
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 197 place count 72 transition count 372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 201 place count 70 transition count 370
Applied a total of 201 rules in 25 ms. Remains 70 /81 variables (removed 11) and now considering 370/560 (removed 190) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 370 rows 70 cols
[2024-06-01 00:45:52] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 00:45:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 00:45:52] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:45:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 00:45:52] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 00:45:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 00:45:53] [INFO ] After 24ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:45:53] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:45:53] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 393 ms.
Successfully simplified 24 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:45:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 30 ms
[2024-06-01 00:45:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 28 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Support contains 28 out of 89 places (down from 36) after GAL structural reductions.
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1090 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 85 transition count 568
Applied a total of 4 rules in 3 ms. Remains 85 /89 variables (removed 4) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 568
Applied a total of 8 rules in 4 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 81/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 19 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Graph (complete) has 1090 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 81/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 20 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Graph (complete) has 1090 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 81/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Graph (complete) has 1090 edges and 89 vertex of which 82 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 82 /89 variables (removed 7) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 82/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 568
Applied a total of 8 rules in 3 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 81/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Graph (complete) has 1090 edges and 89 vertex of which 82 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 82 /89 variables (removed 7) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 82/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 18 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 568
Applied a total of 8 rules in 2 ms. Remains 81 /89 variables (removed 8) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 81/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 31 ms
[2024-06-01 00:45:53] [INFO ] Input system was already deterministic with 568 transitions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 568/568 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 82 transition count 568
Applied a total of 7 rules in 2 ms. Remains 82 /89 variables (removed 7) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 82/89 places, 568/568 transitions.
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:45:53] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:45:54] [INFO ] Input system was already deterministic with 568 transitions.
[2024-06-01 00:45:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:45:54] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:45:54] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:45:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 89 places, 568 transitions and 2286 arcs took 7 ms.
Total runtime 108842 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 : DoubleLock-PT-p3s2-CTLCardinality-2024-00
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2024-03
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2024-05
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2024-07
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2024-09
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2023-12
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2023-13
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2023-14
Could not compute solution for formula : DoubleLock-PT-p3s2-CTLCardinality-2023-15

BK_STOP 1717202754416

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/575/ctl_0_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/575/ctl_1_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/575/ctl_2_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/575/ctl_3_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/575/ctl_4_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/575/ctl_5_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/575/ctl_6_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/575/ctl_7_
ctl formula name DoubleLock-PT-p3s2-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/575/ctl_8_
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="DoubleLock-PT-p3s2"
export BK_EXAMINATION="CTLCardinality"
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 DoubleLock-PT-p3s2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631133100633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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