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.r576-smll-171734919800019.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 MedleyA-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 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 MedleyA-PT-03-LTLCardinality-00
FORMULA_NAME MedleyA-PT-03-LTLCardinality-01
FORMULA_NAME MedleyA-PT-03-LTLCardinality-02
FORMULA_NAME MedleyA-PT-03-LTLCardinality-03
FORMULA_NAME MedleyA-PT-03-LTLCardinality-04
FORMULA_NAME MedleyA-PT-03-LTLCardinality-05
FORMULA_NAME MedleyA-PT-03-LTLCardinality-06
FORMULA_NAME MedleyA-PT-03-LTLCardinality-07
FORMULA_NAME MedleyA-PT-03-LTLCardinality-08
FORMULA_NAME MedleyA-PT-03-LTLCardinality-09
FORMULA_NAME MedleyA-PT-03-LTLCardinality-10
FORMULA_NAME MedleyA-PT-03-LTLCardinality-11
FORMULA_NAME MedleyA-PT-03-LTLCardinality-12
FORMULA_NAME MedleyA-PT-03-LTLCardinality-13
FORMULA_NAME MedleyA-PT-03-LTLCardinality-14
FORMULA_NAME MedleyA-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352289872

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:18:12] [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-06-02 18:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:18:12] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-02 18:18:12] [INFO ] Transformed 108 places.
[2024-06-02 18:18:12] [INFO ] Transformed 100 transitions.
[2024-06-02 18:18:12] [INFO ] Found NUPN structural information;
[2024-06-02 18:18:12] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 101 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 101 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 100 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 100 transition count 92
Applied a total of 16 rules in 67 ms. Remains 100 /108 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 100 cols
[2024-06-02 18:18:13] [INFO ] Computed 9 invariants in 25 ms
[2024-06-02 18:18:13] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-02 18:18:13] [INFO ] Invariant cache hit.
[2024-06-02 18:18:14] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:18:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:15] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 29 ms to minimize.
[2024-06-02 18:18:15] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:18:15] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 3 ms to minimize.
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:16] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:18:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:18:18] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:18:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:18:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:18] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:19] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 92/192 variables, 100/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 131 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7295 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:22] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:18:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/192 variables, 100/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 91/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:18:23] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:18:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:18:23] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:18:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:18:24] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
[2024-06-02 18:18:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 91 unsolved in 8237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 30/30 constraints]
After SMT, in 15682ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 15707ms
Starting structural reductions in LTL mode, iteration 1 : 100/108 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16591 ms. Remains : 100/108 places, 92/100 transitions.
Support contains 31 out of 100 places after structural reductions.
[2024-06-02 18:18:30] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:18:30] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:18:30] [INFO ] Input system was already deterministic with 92 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (665 resets) in 2082 ms. (19 steps per ms) remains 6/20 properties
BEST_FIRST walk for 40001 steps (165 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (192 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (177 resets) in 232 ms. (171 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (171 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (199 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (207 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
[2024-06-02 18:18:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 91/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:18:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 92/192 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 110 constraints, problems are : Problem set: 0 solved, 6 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 91/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:18:31] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 92/192 variables, 100/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 117 constraints, problems are : Problem set: 0 solved, 6 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 715 steps, including 1 resets, run visited all 6 properties in 45 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 62 ms.
FORMULA MedleyA-PT-03-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 100 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 100 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||G(p2)||G(p3)||p0)))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 94 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 94 transition count 86
Applied a total of 12 rules in 12 ms. Remains 94 /100 variables (removed 6) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 94 cols
[2024-06-02 18:18:32] [INFO ] Computed 9 invariants in 10 ms
[2024-06-02 18:18:32] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:18:32] [INFO ] Invariant cache hit.
[2024-06-02 18:18:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:18:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 2/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:33] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:18:33] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:18:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 11 ms to minimize.
[2024-06-02 18:18:33] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/180 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 107 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 2/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/180 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:37] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:18:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:18:38] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:18:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:18:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:41] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:18:41] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 11942 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 13/13 constraints]
After SMT, in 15435ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 15437ms
Starting structural reductions in LTL mode, iteration 1 : 94/100 places, 86/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15668 ms. Remains : 94/100 places, 86/92 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 336 ms.
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Computed a total of 94 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 86
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2 p3), (X (X (NOT (AND p1 (NOT p0) p2 p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) p2 p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 37 ms. Reduced automaton from 3 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-00 finished in 16718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Graph (complete) has 178 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 98 transition count 76
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 83 transition count 76
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 31 place count 83 transition count 68
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 47 place count 75 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 73 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 73 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 51 place count 73 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 72 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 95 place count 51 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 50 transition count 43
Applied a total of 96 rules in 52 ms. Remains 50 /100 variables (removed 50) and now considering 43/92 (removed 49) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-02 18:18:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:18:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:18:49] [INFO ] Invariant cache hit.
[2024-06-02 18:18:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-02 18:18:49] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-02 18:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/93 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 43/92 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 100 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1978ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/100 places, 43/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2183 ms. Remains : 50/100 places, 43/92 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-02
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-02 finished in 2319 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((X(F(p1))||p0))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 93 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 93 transition count 86
Applied a total of 13 rules in 11 ms. Remains 93 /100 variables (removed 7) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:18:51] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:18:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:18:51] [INFO ] Invariant cache hit.
[2024-06-02 18:18:51] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:18:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:18:52] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:53] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:18:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:54] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 110 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:56] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 85/196 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:18:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:18:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:18:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:18:58] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:18:59] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 202 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8448 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 16/16 constraints]
After SMT, in 12437ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 12439ms
Starting structural reductions in LTL mode, iteration 1 : 93/100 places, 86/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12666 ms. Remains : 93/100 places, 86/92 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 93 stabilizing places and 86 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 86
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-06 finished in 13445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 93 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 93 transition count 86
Applied a total of 13 rules in 13 ms. Remains 93 /100 variables (removed 7) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:19:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:19:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:19:05] [INFO ] Invariant cache hit.
[2024-06-02 18:19:05] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:19:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:19:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:07] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:08] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/179 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 107 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4891 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 85/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 195 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5209 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints]
After SMT, in 10129ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 10131ms
Starting structural reductions in LTL mode, iteration 1 : 93/100 places, 86/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10344 ms. Remains : 93/100 places, 86/92 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-07 finished in 10518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((p1 U (p2||G(p1))))))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 94 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 94 transition count 87
Applied a total of 11 rules in 5 ms. Remains 94 /100 variables (removed 6) and now considering 87/92 (removed 5) transitions.
// Phase 1: matrix 87 rows 94 cols
[2024-06-02 18:19:15] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:19:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:19:15] [INFO ] Invariant cache hit.
[2024-06-02 18:19:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-06-02 18:19:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:19:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:17] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:19] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5000 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:21] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 5 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:19:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 200 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6082 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints]
After SMT, in 11099ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11100ms
Starting structural reductions in LTL mode, iteration 1 : 94/100 places, 87/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11269 ms. Remains : 94/100 places, 87/92 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 219 steps with 10 reset in 2 ms.
FORMULA MedleyA-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-11 finished in 11494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 92 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 92 transition count 85
Applied a total of 15 rules in 6 ms. Remains 92 /100 variables (removed 8) and now considering 85/92 (removed 7) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-06-02 18:19:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:19:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:19:27] [INFO ] Invariant cache hit.
[2024-06-02 18:19:27] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:19:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:28] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:19:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 103 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3639 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/177 variables, 92/103 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 84/187 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:19:32] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5064 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 8727ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8729ms
Starting structural reductions in LTL mode, iteration 1 : 92/100 places, 85/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9010 ms. Remains : 92/100 places, 85/92 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 7398 steps with 1845 reset in 10 ms.
FORMULA MedleyA-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-03-LTLCardinality-13 finished in 9214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p2)&&p1)||p0)))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 92/92 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 94 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 94 transition count 87
Applied a total of 11 rules in 4 ms. Remains 94 /100 variables (removed 6) and now considering 87/92 (removed 5) transitions.
// Phase 1: matrix 87 rows 94 cols
[2024-06-02 18:19:36] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 18:19:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:19:36] [INFO ] Invariant cache hit.
[2024-06-02 18:19:36] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-06-02 18:19:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:19:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/181 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:39] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 112 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:19:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 204 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10370 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 16/16 constraints]
After SMT, in 16165ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 16166ms
Starting structural reductions in LTL mode, iteration 1 : 94/100 places, 87/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16341 ms. Remains : 94/100 places, 87/92 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 94 stabilizing places and 87 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 87
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-03-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-03-LTLCardinality-15 finished in 17107 ms.
All properties solved by simple procedures.
Total runtime 100933 ms.

BK_STOP 1717352393834

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyA-PT-03"
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 MedleyA-PT-03, 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 r576-smll-171734919800019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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