fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631133100635
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DoubleLock-PT-p3s2

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1210.396 555004.00 636027.00 1524.60 FFFFTTFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-01
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-02
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-03
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-04
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-05
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-06
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-07
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-08
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-09
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-10
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-11
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-12
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-13
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-14
FORMULA_NAME DoubleLock-PT-p3s2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716416239130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 22:17:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:17:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:17:20] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-22 22:17:20] [INFO ] Transformed 112 places.
[2024-05-22 22:17:20] [INFO ] Transformed 744 transitions.
[2024-05-22 22:17:20] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 25 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 712
Applied a total of 1 rules in 50 ms. Remains 91 /92 variables (removed 1) and now considering 712/712 (removed 0) transitions.
[2024-05-22 22:17:21] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 91 cols
[2024-05-22 22:17:21] [INFO ] Computed 3 invariants in 41 ms
[2024-05-22 22:17:21] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-22 22:17:21] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 22:17:21] [INFO ] Invariant cache hit.
[2024-05-22 22:17:21] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 22:17:22] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-22 22:17:22] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 22:17:22] [INFO ] Invariant cache hit.
[2024-05-22 22:17:22] [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-05-22 22:17:29] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 13 ms to minimize.
Problem TDEAD464 is UNSAT
[2024-05-22 22:17:29] [INFO ] Deduced a trap composed of 49 places in 128 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) 515/605 variables, 90/95 constraints. Problems are: Problem set: 144 solved, 566 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 47/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (OVERLAPS) 1/606 variables, 1/143 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/143 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/143 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 143 constraints, problems are : Problem set: 144 solved, 566 unsolved in 23444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 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) 515/605 variables, 90/95 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 47/142 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 32/174 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/174 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 9 (OVERLAPS) 1/606 variables, 1/175 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 534/709 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/709 constraints. Problems are: Problem set: 144 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 709 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 566/710 constraints, Known Traps: 2/2 constraints]
After SMT, in 54696ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 54733ms
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 : 91/92 places, 568/712 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 84 transition count 568
Applied a total of 7 rules in 6 ms. Remains 84 /91 variables (removed 7) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:18:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 84 cols
[2024-05-22 22:18:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 22:18:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 22:18:17] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:18:17] [INFO ] Invariant cache hit.
[2024-05-22 22:18:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:18:17] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/92 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56192 ms. Remains : 84/92 places, 568/712 transitions.
Support contains 26 out of 84 places after structural reductions.
[2024-05-22 22:18:17] [INFO ] Flatten gal took : 85 ms
[2024-05-22 22:18:17] [INFO ] Flatten gal took : 101 ms
[2024-05-22 22:18:17] [INFO ] Input system was already deterministic with 568 transitions.
RANDOM walk for 40012 steps (465 resets) in 1239 ms. (32 steps per ms) remains 5/23 properties
BEST_FIRST walk for 40002 steps (92 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (100 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 389 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (103 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
[2024-05-22 22:18:18] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:18:18] [INFO ] Invariant cache hit.
[2024-05-22 22:18:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 51/473 variables, and 1 constraints, problems are : Problem set: 5 solved, 0 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/84 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 903ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 568
Applied a total of 2 rules in 14 ms. Remains 82 /84 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:18:19] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 22:18:19] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 22:18:20] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 22:18:20] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:18:20] [INFO ] Invariant cache hit.
[2024-05-22 22:18:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:18:20] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:18:20] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:18:20] [INFO ] Invariant cache hit.
[2024-05-22 22:18:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 566 unsolved in 15095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 566/691 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-05-22 22:18:51] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:18:52] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-05-22 22:18:52] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 694 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 3/3 constraints]
After SMT, in 45830ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 45835ms
Starting structural reductions in LTL mode, iteration 1 : 82/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46262 ms. Remains : 82/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-00
Product exploration explored 100000 steps with 33058 reset in 285 ms.
Product exploration explored 100000 steps with 33217 reset in 177 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1041 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40003 steps (461 resets) in 241 ms. (165 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (389 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-05-22 22:19:07] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:07] [INFO ] Invariant cache hit.
[2024-05-22 22:19:07] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 382/445 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 40/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/471 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 22:19:07] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 382/445 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 40/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 471/471 variables, and 125 constraints, problems are : Problem set: 1 solved, 0 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 449ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 568/568 transitions.
Applied a total of 0 rules in 39 ms. Remains 82 /82 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:19:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:08] [INFO ] Invariant cache hit.
[2024-05-22 22:19:08] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 22:19:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:08] [INFO ] Invariant cache hit.
[2024-05-22 22:19:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:19:08] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-22 22:19:08] [INFO ] Redundant transitions in 24 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:19:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:08] [INFO ] Invariant cache hit.
[2024-05-22 22:19:08] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 566 unsolved in 14909 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 566/691 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-05-22 22:19:39] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:19:39] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-22 22:19:40] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 694 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 3/3 constraints]
After SMT, in 45342ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 45347ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45812 ms. Remains : 82/82 places, 568/568 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1041 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
RANDOM walk for 10851 steps (125 resets) in 59 ms. (180 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering criterion allowed to conclude after 264 steps with 5 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-00 finished in 95351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:19:55] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 22:19:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 22:19:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 22:19:55] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:55] [INFO ] Invariant cache hit.
[2024-05-22 22:19:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:19:55] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-22 22:19:55] [INFO ] Redundant transitions in 11 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:19:55] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:19:55] [INFO ] Invariant cache hit.
[2024-05-22 22:19:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43808ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43821ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44256 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-01 finished in 44367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:20:39] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:39] [INFO ] Invariant cache hit.
[2024-05-22 22:20:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 22:20:39] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:39] [INFO ] Invariant cache hit.
[2024-05-22 22:20:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:20:39] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-22 22:20:39] [INFO ] Redundant transitions in 4 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:20:39] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:39] [INFO ] Invariant cache hit.
[2024-05-22 22:20:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12874 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43270ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43630 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-02
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-02 finished in 43675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:21:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:23] [INFO ] Invariant cache hit.
[2024-05-22 22:21:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 22:21:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:23] [INFO ] Invariant cache hit.
[2024-05-22 22:21:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:21:23] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:21:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:23] [INFO ] Invariant cache hit.
[2024-05-22 22:21:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43634ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43639ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44179 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Detected a total of 7/81 stabilizing places and 176/568 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-04 finished in 44531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((G(X(p0)) U p1))||G(p0)) U p2))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 568
Applied a total of 2 rules in 6 ms. Remains 82 /84 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:22:07] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 22:22:07] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 22:22:07] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 22:22:07] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:07] [INFO ] Invariant cache hit.
[2024-05-22 22:22:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:22:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:22:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:08] [INFO ] Invariant cache hit.
[2024-05-22 22:22:08] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 566 unsolved in 14754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 389/471 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 566/691 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-05-22 22:22:39] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:22:39] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:22:39] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 694 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 3/3 constraints]
After SMT, in 45146ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 45153ms
Starting structural reductions in LTL mode, iteration 1 : 82/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45549 ms. Remains : 82/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-06
Product exploration explored 100000 steps with 33453 reset in 130 ms.
Product exploration explored 100000 steps with 33351 reset in 205 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1041 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 208 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
RANDOM walk for 40008 steps (472 resets) in 190 ms. (209 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (100 resets) in 109 ms. (363 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (98 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2024-05-22 22:22:54] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:54] [INFO ] Invariant cache hit.
[2024-05-22 22:22:54] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 375/427 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/471 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/471 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 52/471 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/82 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 351 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) p2 (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) p2 (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
[2024-05-22 22:22:55] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:55] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 p1), (X p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT p2))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 17 factoid took 358 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-06 finished in 48248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:22:55] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 22:22:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:22:56] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 22:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:56] [INFO ] Invariant cache hit.
[2024-05-22 22:22:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:22:56] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-22 22:22:56] [INFO ] Redundant transitions in 3 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:22:56] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:56] [INFO ] Invariant cache hit.
[2024-05-22 22:22:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43525ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43531ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43910 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-07
Stuttering criterion allowed to conclude after 55543 steps with 1021 reset in 109 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-07 finished in 44074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:23:40] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:40] [INFO ] Invariant cache hit.
[2024-05-22 22:23:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 22:23:40] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:40] [INFO ] Invariant cache hit.
[2024-05-22 22:23:40] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:23:40] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-22 22:23:40] [INFO ] Redundant transitions in 2 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:23:40] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:40] [INFO ] Invariant cache hit.
[2024-05-22 22:23:40] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43174ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43499 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-10
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-10 finished in 43573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:24:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:23] [INFO ] Invariant cache hit.
[2024-05-22 22:24:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 22:24:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:23] [INFO ] Invariant cache hit.
[2024-05-22 22:24:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:24:23] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-22 22:24:23] [INFO ] Redundant transitions in 6 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:24:23] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:23] [INFO ] Invariant cache hit.
[2024-05-22 22:24:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12770 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 42917ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 42923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43216 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-11
Stuttering criterion allowed to conclude after 603 steps with 9 reset in 3 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-11 finished in 43314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:25:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:06] [INFO ] Invariant cache hit.
[2024-05-22 22:25:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 22:25:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:06] [INFO ] Invariant cache hit.
[2024-05-22 22:25:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:25:07] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:25:07] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:07] [INFO ] Invariant cache hit.
[2024-05-22 22:25:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43151ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43155ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43452 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-14 finished in 43549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 3 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:25:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:50] [INFO ] Invariant cache hit.
[2024-05-22 22:25:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 22:25:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:50] [INFO ] Invariant cache hit.
[2024-05-22 22:25:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:25:50] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:25:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:50] [INFO ] Invariant cache hit.
[2024-05-22 22:25:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12858 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43256ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43263ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43561 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLCardinality-15
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLCardinality-15 finished in 43640 ms.
All properties solved by simple procedures.
Total runtime 553625 ms.

BK_STOP 1716416794134

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p3s2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631133100635"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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