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.r476-tall-171620505500259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CSRepetitions-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505500259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 136K Apr 12 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 12 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 574K Apr 12 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 120K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 491K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 392K Apr 12 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 424K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717202655299

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:44:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:44:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:44:16] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-01 00:44:16] [INFO ] Transformed 498 places.
[2024-06-01 00:44:16] [INFO ] Transformed 833 transitions.
[2024-06-01 00:44:16] [INFO ] Parsed PT model containing 498 places and 833 transitions and 3087 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-PT-07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 449 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 18 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2024-06-01 00:44:16] [INFO ] Computed 56 invariants in 31 ms
[2024-06-01 00:44:17] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 00:44:17] [INFO ] Invariant cache hit.
[2024-06-01 00:44:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:44:17] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:44:17] [INFO ] Invariant cache hit.
[2024-06-01 00:44:17] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 61177ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 61200ms
Finished structural reductions in LTL mode , in 1 iterations and 61774 ms. Remains : 498/498 places, 833/833 transitions.
Support contains 449 out of 498 places after structural reductions.
[2024-06-01 00:45:18] [INFO ] Flatten gal took : 85 ms
[2024-06-01 00:45:18] [INFO ] Flatten gal took : 55 ms
[2024-06-01 00:45:18] [INFO ] Input system was already deterministic with 833 transitions.
RANDOM walk for 40000 steps (393 resets) in 1843 ms. (21 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
[2024-06-01 00:45:19] [INFO ] Invariant cache hit.
[2024-06-01 00:45:19] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 116/1331 variables, and 10 constraints, problems are : Problem set: 8 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 10/56 constraints, State Equation: 0/498 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CSRepetitions-PT-07-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 49 stable transitions
FORMULA CSRepetitions-PT-07-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 49 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 44 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:45:20] [INFO ] Invariant cache hit.
[2024-06-01 00:45:20] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 00:45:20] [INFO ] Invariant cache hit.
[2024-06-01 00:45:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:45:21] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:45:21] [INFO ] Invariant cache hit.
[2024-06-01 00:45:21] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60955ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60962ms
Finished structural reductions in LTL mode , in 1 iterations and 61858 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 599 ms.
Product exploration explored 100000 steps with 50000 reset in 484 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-07-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-07-LTLCardinality-01 finished in 63312 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(p0) U (p1&&X(p0))))||G(p2)))'
Support contains 393 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 6 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:46:23] [INFO ] Invariant cache hit.
[2024-06-01 00:46:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 00:46:23] [INFO ] Invariant cache hit.
[2024-06-01 00:46:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:46:23] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:46:23] [INFO ] Invariant cache hit.
[2024-06-01 00:46:23] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60981ms
Finished structural reductions in LTL mode , in 1 iterations and 61350 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-02
Product exploration explored 100000 steps with 25033 reset in 821 ms.
Product exploration explored 100000 steps with 25080 reset in 875 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 118 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
[2024-06-01 00:47:27] [INFO ] Invariant cache hit.
[2024-06-01 00:47:28] [INFO ] [Real]Absence check using 56 positive place invariants in 31 ms returned sat
[2024-06-01 00:47:29] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2024-06-01 00:47:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:47:29] [INFO ] [Nat]Absence check using 56 positive place invariants in 27 ms returned sat
[2024-06-01 00:47:30] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-06-01 00:47:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:47:30] [INFO ] [Nat]Added 49 Read/Feed constraints in 31 ms returned sat
[2024-06-01 00:47:30] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 47 ms.
[2024-06-01 00:47:30] [INFO ] Added : 16 causal constraints over 4 iterations in 300 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 50 out of 498 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 3 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:47:30] [INFO ] Invariant cache hit.
[2024-06-01 00:47:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 00:47:30] [INFO ] Invariant cache hit.
[2024-06-01 00:47:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:47:31] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:47:31] [INFO ] Invariant cache hit.
[2024-06-01 00:47:31] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60906ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60914ms
Finished structural reductions in LTL mode , in 1 iterations and 61284 ms. Remains : 498/498 places, 833/833 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
RANDOM walk for 64 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
[2024-06-01 00:48:32] [INFO ] Invariant cache hit.
[2024-06-01 00:48:33] [INFO ] [Real]Absence check using 56 positive place invariants in 34 ms returned sat
[2024-06-01 00:48:34] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2024-06-01 00:48:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:48:34] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2024-06-01 00:48:35] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-06-01 00:48:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:48:35] [INFO ] [Nat]Added 49 Read/Feed constraints in 31 ms returned sat
[2024-06-01 00:48:35] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 42 ms.
[2024-06-01 00:48:35] [INFO ] Added : 16 causal constraints over 4 iterations in 274 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration explored 100000 steps with 25010 reset in 527 ms.
Product exploration explored 100000 steps with 25150 reset in 532 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 50 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 56 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:48:37] [INFO ] Redundant transitions in 54 ms returned []
Running 784 sub problems to find dead transitions.
[2024-06-01 00:48:37] [INFO ] Invariant cache hit.
[2024-06-01 00:48:37] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60908ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61034 ms. Remains : 498/498 places, 833/833 transitions.
Support contains 50 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:49:38] [INFO ] Invariant cache hit.
[2024-06-01 00:49:38] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 00:49:38] [INFO ] Invariant cache hit.
[2024-06-01 00:49:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:49:39] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:49:39] [INFO ] Invariant cache hit.
[2024-06-01 00:49:39] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60905ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Finished structural reductions in LTL mode , in 1 iterations and 61725 ms. Remains : 498/498 places, 833/833 transitions.
Treatment of property CSRepetitions-PT-07-LTLCardinality-02 finished in 256768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(G(p2))))'
Support contains 351 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 5 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:50:40] [INFO ] Invariant cache hit.
[2024-06-01 00:50:40] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 00:50:40] [INFO ] Invariant cache hit.
[2024-06-01 00:50:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:50:40] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:50:40] [INFO ] Invariant cache hit.
[2024-06-01 00:50:40] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60900ms
Finished structural reductions in LTL mode , in 1 iterations and 61298 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLCardinality-04 finished in 61454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 399 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 5 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:51:41] [INFO ] Invariant cache hit.
[2024-06-01 00:51:41] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 00:51:41] [INFO ] Invariant cache hit.
[2024-06-01 00:51:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:51:42] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:51:42] [INFO ] Invariant cache hit.
[2024-06-01 00:51:42] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60952ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60963ms
Finished structural reductions in LTL mode , in 1 iterations and 61402 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-07-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-07-LTLCardinality-05 finished in 62432 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((G(!p0)||(p1&&G(p2))))))'
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 32 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2024-06-01 00:52:44] [INFO ] Invariant cache hit.
[2024-06-01 00:52:44] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 00:52:44] [INFO ] Invariant cache hit.
[2024-06-01 00:52:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:52:44] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2024-06-01 00:52:45] [INFO ] Redundant transitions in 13 ms returned []
Running 784 sub problems to find dead transitions.
[2024-06-01 00:52:45] [INFO ] Invariant cache hit.
[2024-06-01 00:52:45] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61754 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-06
Product exploration explored 100000 steps with 775 reset in 1253 ms.
Stack based approach found an accepted trace after 4443 steps with 35 reset with depth 132 and stack size 132 in 57 ms.
FORMULA CSRepetitions-PT-07-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLCardinality-06 finished in 63222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 402 transition count 785
Discarding 329 places :
Symmetric choice reduction at 0 with 329 rule applications. Total rules 473 place count 73 transition count 456
Iterating global reduction 0 with 329 rules applied. Total rules applied 802 place count 73 transition count 456
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 842 place count 33 transition count 136
Iterating global reduction 0 with 40 rules applied. Total rules applied 882 place count 33 transition count 136
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 922 place count 33 transition count 96
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 936 place count 26 transition count 89
Applied a total of 936 rules in 58 ms. Remains 26 /498 variables (removed 472) and now considering 89/833 (removed 744) transitions.
[2024-06-01 00:53:47] [INFO ] Flow matrix only has 41 transitions (discarded 48 similar events)
// Phase 1: matrix 41 rows 26 cols
[2024-06-01 00:53:47] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 00:53:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 00:53:47] [INFO ] Flow matrix only has 41 transitions (discarded 48 similar events)
[2024-06-01 00:53:47] [INFO ] Invariant cache hit.
[2024-06-01 00:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:53:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 00:53:47] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 00:53:47] [INFO ] Flow matrix only has 41 transitions (discarded 48 similar events)
[2024-06-01 00:53:47] [INFO ] Invariant cache hit.
[2024-06-01 00:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 41/67 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 35 constraints, problems are : Problem set: 0 solved, 80 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 41/67 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 80/115 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 115 constraints, problems are : Problem set: 0 solved, 80 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 1256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/498 places, 89/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1380 ms. Remains : 26/498 places, 89/833 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-09
Product exploration explored 100000 steps with 7356 reset in 236 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CSRepetitions-PT-07-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLCardinality-09 finished in 1710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 22 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2024-06-01 00:53:49] [INFO ] Computed 56 invariants in 14 ms
[2024-06-01 00:53:49] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 00:53:49] [INFO ] Invariant cache hit.
[2024-06-01 00:53:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 00:53:49] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-06-01 00:53:49] [INFO ] Invariant cache hit.
[2024-06-01 00:53:49] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 603 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (OVERLAPS) 49/498 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (OVERLAPS) 833/1331 variables, 498/554 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1331 variables, 49/603 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 784/1387 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1387 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 498/498 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 60914ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Finished structural reductions in LTL mode , in 1 iterations and 61773 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLCardinality-11 finished in 61934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 335 places :
Symmetric choice reduction at 0 with 335 rule applications. Total rules 482 place count 65 transition count 449
Iterating global reduction 0 with 335 rules applied. Total rules applied 817 place count 65 transition count 449
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 857 place count 25 transition count 129
Iterating global reduction 0 with 40 rules applied. Total rules applied 897 place count 25 transition count 129
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 937 place count 25 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 954 place count 14 transition count 83
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 18 edges and 14 vertex of which 10 / 14 are part of one of the 1 SCC in 4 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 37 rules applied. Total rules applied 991 place count 5 transition count 47
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1031 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1032 place count 5 transition count 6
Applied a total of 1032 rules in 75 ms. Remains 5 /498 variables (removed 493) and now considering 6/833 (removed 827) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-06-01 00:54:51] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 00:54:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 00:54:51] [INFO ] Invariant cache hit.
[2024-06-01 00:54:51] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 00:54:51] [INFO ] Redundant transitions in 11 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 00:54:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/11 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/498 places, 6/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 5/498 places, 6/833 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLCardinality-14 finished in 267 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(p0) U (p1&&X(p0))))||G(p2)))'
[2024-06-01 00:54:51] [INFO ] Flatten gal took : 43 ms
[2024-06-01 00:54:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:54:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 498 places, 833 transitions and 3087 arcs took 9 ms.
Total runtime 635143 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CSRepetitions-PT-07, 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 r476-tall-171620505500259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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