java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:05:56,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:05:56,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:05:56,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:05:56,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:05:56,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:05:56,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:05:56,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:05:56,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:05:56,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:05:56,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:05:56,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:05:56,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:05:56,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:05:56,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:05:56,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:05:56,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:05:56,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:05:56,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:05:56,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:05:56,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:05:56,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:05:56,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:05:56,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:05:56,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:05:56,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:05:56,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:05:56,551 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:05:56,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:05:56,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:05:56,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:05:56,552 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:05:56,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:05:56,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:05:56,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:05:56,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:05:56,563 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:05:56,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:05:56,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:05:56,564 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:05:56,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:05:56,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:05:56,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:05:56,565 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:05:56,565 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:05:56,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:05:56,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:05:56,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:05:56,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:05:56,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:05:56,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:05:56,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:05:56,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:05:56,566 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:05:56,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:05:56,604 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:05:56,607 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:05:56,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:05:56,608 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:05:56,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:05:56,757 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:05:56,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:05:56,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:05:56,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:05:56,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:05:56,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56, skipping insertion in model container [2018-02-04 15:05:56,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:05:56,806 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:05:56,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:05:56,899 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:05:56,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56 WrapperNode [2018-02-04 15:05:56,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:05:56,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:05:56,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:05:56,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:05:56,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... [2018-02-04 15:05:56,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:05:56,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:05:56,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:05:56,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:05:56,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:05:56,962 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:05:56,962 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:05:56,962 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-02-04 15:05:56,962 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-02-04 15:05:56,963 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:05:56,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:05:56,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:05:57,100 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:05:57,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:57 BoogieIcfgContainer [2018-02-04 15:05:57,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:05:57,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:05:57,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:05:57,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:05:57,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:05:56" (1/3) ... [2018-02-04 15:05:57,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6ab0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:57, skipping insertion in model container [2018-02-04 15:05:57,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:05:56" (2/3) ... [2018-02-04 15:05:57,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6ab0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:05:57, skipping insertion in model container [2018-02-04 15:05:57,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:05:57" (3/3) ... [2018-02-04 15:05:57,105 INFO L107 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:05:57,110 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:05:57,114 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 15:05:57,138 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:05:57,138 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:05:57,138 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:05:57,138 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:05:57,138 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:05:57,138 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:05:57,139 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:05:57,139 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:05:57,139 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:05:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-04 15:05:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:05:57,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,156 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:57,156 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-02-04 15:05:57,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:57,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:05:57,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,269 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false] [2018-02-04 15:05:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 15:05:57,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 15:05:57,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:05:57,284 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-02-04 15:05:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:57,297 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 15:05:57,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 15:05:57,298 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-02-04 15:05:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:57,305 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:05:57,305 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 15:05:57,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:05:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 15:05:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 15:05:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 15:05:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 15:05:57,381 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-02-04 15:05:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:57,381 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 15:05:57,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 15:05:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 15:05:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:05:57,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,382 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:57,382 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-02-04 15:05:57,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:57,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:05:57,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,454 INFO L182 omatonBuilderFactory]: Interpolants [146#true, 147#false, 148#(= 1 (select |#valid| |main_#t~malloc9.base|)), 149#(= 1 (select |#valid| main_~numbers~0.base)), 150#(= 1 (select |#valid| |SelectionSort_#in~a.base|)), 151#(= 1 (select |#valid| SelectionSort_~a.base))] [2018-02-04 15:05:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:05:57,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:05:57,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:05:57,456 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-02-04 15:05:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:57,575 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 15:05:57,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:05:57,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-04 15:05:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:57,576 INFO L225 Difference]: With dead ends: 39 [2018-02-04 15:05:57,576 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 15:05:57,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 15:05:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 15:05:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 15:05:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-04 15:05:57,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-02-04 15:05:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:57,581 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-04 15:05:57,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:05:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-04 15:05:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:05:57,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,582 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:57,582 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-02-04 15:05:57,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:57,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:05:57,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,621 INFO L182 omatonBuilderFactory]: Interpolants [234#true, 235#false, 236#(<= (+ SelectionSort_~j~0 1) SelectionSort_~array_size)] [2018-02-04 15:05:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:05:57,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:05:57,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:05:57,622 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-02-04 15:05:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:57,637 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 15:05:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:05:57,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 15:05:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:57,638 INFO L225 Difference]: With dead ends: 41 [2018-02-04 15:05:57,638 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 15:05:57,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:05:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 15:05:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 15:05:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 15:05:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 15:05:57,642 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-02-04 15:05:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:57,642 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 15:05:57,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:05:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 15:05:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:05:57,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:57,643 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-02-04 15:05:57,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:57,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:05:57,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,795 INFO L182 omatonBuilderFactory]: Interpolants [320#false, 321#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 322#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 323#(and (= 0 |SelectionSort_#in~a.offset|) (<= (* 4 |SelectionSort_#in~array_size|) (select |#length| |SelectionSort_#in~a.base|))), 324#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~i~0 0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 325#(and (= SelectionSort_~a.offset 0) (<= 1 SelectionSort_~j~0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 326#(and (= SelectionSort_~a.offset 0) (<= 1 SelectionSort_~j~0) (<= (+ (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base))), 319#true] [2018-02-04 15:05:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:57,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:05:57,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:05:57,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:57,796 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-02-04 15:05:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:57,980 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-04 15:05:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:05:57,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 15:05:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:57,982 INFO L225 Difference]: With dead ends: 69 [2018-02-04 15:05:57,982 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 15:05:57,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:05:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 15:05:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-04 15:05:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 15:05:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-04 15:05:57,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-02-04 15:05:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:57,986 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-04 15:05:57,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:05:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-04 15:05:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:05:57,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:57,987 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-02-04 15:05:57,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:58,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:05:58,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,055 INFO L182 omatonBuilderFactory]: Interpolants [464#(and (= SelectionSort_~a.offset 0) (<= 4 (select |#length| SelectionSort_~a.base)) (= SelectionSort_~min~0 0)), 457#true, 458#false, 459#(= 0 |main_#t~malloc9.offset|), 460#(= 0 main_~numbers~0.offset), 461#(= 0 |SelectionSort_#in~a.offset|), 462#(and (= SelectionSort_~a.offset 0) (= 0 SelectionSort_~i~0)), 463#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~min~0 0))] [2018-02-04 15:05:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:05:58,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:05:58,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:58,055 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-04 15:05:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,176 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-04 15:05:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:05:58,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 15:05:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,177 INFO L225 Difference]: With dead ends: 83 [2018-02-04 15:05:58,177 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 15:05:58,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:05:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 15:05:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-04 15:05:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 15:05:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-04 15:05:58,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-02-04 15:05:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,182 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-04 15:05:58,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:05:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-04 15:05:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 15:05:58,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,183 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,183 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-02-04 15:05:58,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:05:58,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:05:58,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,227 INFO L182 omatonBuilderFactory]: Interpolants [624#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|), 621#true, 622#false, 623#(= |#valid| |old(#valid)|)] [2018-02-04 15:05:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:05:58,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:05:58,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:05:58,228 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-02-04 15:05:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,270 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-02-04 15:05:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:05:58,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 15:05:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,272 INFO L225 Difference]: With dead ends: 62 [2018-02-04 15:05:58,272 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 15:05:58,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:05:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 15:05:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 15:05:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 15:05:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-02-04 15:05:58,275 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-02-04 15:05:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,276 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-02-04 15:05:58,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:05:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-02-04 15:05:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 15:05:58,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,276 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,276 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-02-04 15:05:58,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:58,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:05:58,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,340 INFO L182 omatonBuilderFactory]: Interpolants [752#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base)) (= SelectionSort_~i~0 0)), 745#true, 746#false, 747#(= 0 |main_#t~malloc9.offset|), 748#(= 0 main_~numbers~0.offset), 749#(= 0 |SelectionSort_#in~a.offset|), 750#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~i~0 0)), 751#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (= SelectionSort_~i~0 0))] [2018-02-04 15:05:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:05:58,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:05:58,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:58,341 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 8 states. [2018-02-04 15:05:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,413 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 15:05:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:05:58,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 15:05:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,414 INFO L225 Difference]: With dead ends: 67 [2018-02-04 15:05:58,414 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 15:05:58,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:05:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 15:05:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-04 15:05:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 15:05:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 15:05:58,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-02-04 15:05:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,418 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 15:05:58,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:05:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 15:05:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:05:58,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,419 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,419 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-02-04 15:05:58,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:58,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 15:05:58,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,469 INFO L182 omatonBuilderFactory]: Interpolants [888#true, 889#false, 890#(<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))), 891#(and (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (<= SelectionSort_~min~0 SelectionSort_~j~0)), 892#(and (<= (+ SelectionSort_~min~0 1) SelectionSort_~j~0) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0)))), 893#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))))] [2018-02-04 15:05:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:05:58,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:05:58,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:05:58,470 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 15:05:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,571 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-04 15:05:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:05:58,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 15:05:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,572 INFO L225 Difference]: With dead ends: 107 [2018-02-04 15:05:58,572 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 15:05:58,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:05:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 15:05:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2018-02-04 15:05:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 15:05:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-02-04 15:05:58,577 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 23 [2018-02-04 15:05:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,577 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-02-04 15:05:58,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:05:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-02-04 15:05:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 15:05:58,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,578 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,578 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1011769969, now seen corresponding path program 1 times [2018-02-04 15:05:58,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:58,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:05:58,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,710 INFO L182 omatonBuilderFactory]: Interpolants [1074#true, 1075#false, 1076#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 1077#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 1078#(and (= 0 |SelectionSort_#in~a.offset|) (<= (* 4 |SelectionSort_#in~array_size|) (select |#length| |SelectionSort_#in~a.base|))), 1079#(and (= SelectionSort_~a.offset 0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 1080#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 1081#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (<= (+ (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base))), 1082#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~min~0) (<= (+ (* 4 SelectionSort_~min~0) 4) (select |#length| SelectionSort_~a.base))), 1083#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (= SelectionSort_~a.offset 0) (<= (+ (* 4 SelectionSort_~min~0) 4) (select |#length| SelectionSort_~a.base)))] [2018-02-04 15:05:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:05:58,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:05:58,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:05:58,710 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 10 states. [2018-02-04 15:05:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,887 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-02-04 15:05:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:05:58,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 15:05:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,888 INFO L225 Difference]: With dead ends: 94 [2018-02-04 15:05:58,889 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 15:05:58,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:05:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 15:05:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2018-02-04 15:05:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 15:05:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-02-04 15:05:58,892 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 24 [2018-02-04 15:05:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,892 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-02-04 15:05:58,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:05:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-02-04 15:05:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 15:05:58,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,893 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,893 INFO L371 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1016956569, now seen corresponding path program 1 times [2018-02-04 15:05:58,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:58,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 15:05:58,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,940 INFO L182 omatonBuilderFactory]: Interpolants [1254#true, 1255#false, 1256#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 1257#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 1258#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 2)), 1259#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 1))] [2018-02-04 15:05:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:05:58,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:05:58,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:05:58,941 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2018-02-04 15:05:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:58,981 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-02-04 15:05:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:05:58,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 15:05:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:58,981 INFO L225 Difference]: With dead ends: 114 [2018-02-04 15:05:58,981 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 15:05:58,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 15:05:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-02-04 15:05:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 15:05:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2018-02-04 15:05:58,984 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 33 [2018-02-04 15:05:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:58,985 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2018-02-04 15:05:58,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:05:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2018-02-04 15:05:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 15:05:58,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:58,985 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:58,985 INFO L371 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1805684219, now seen corresponding path program 2 times [2018-02-04 15:05:58,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:58,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:59,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:05:59,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,053 INFO L182 omatonBuilderFactory]: Interpolants [1464#true, 1465#false, 1466#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1467#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1468#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1469#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0)))), 1470#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base))), 1471#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 8 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:05:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:05:59,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:05:59,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:59,054 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 8 states. [2018-02-04 15:05:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:59,195 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-04 15:05:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:05:59,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 15:05:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:59,195 INFO L225 Difference]: With dead ends: 93 [2018-02-04 15:05:59,196 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 15:05:59,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:05:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 15:05:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-02-04 15:05:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 15:05:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-02-04 15:05:59,199 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 39 [2018-02-04 15:05:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:59,199 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-02-04 15:05:59,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:05:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-02-04 15:05:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 15:05:59,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:59,200 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:59,200 INFO L371 AbstractCegarLoop]: === Iteration 12 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash -141635977, now seen corresponding path program 1 times [2018-02-04 15:05:59,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:59,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:59,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:05:59,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,274 INFO L182 omatonBuilderFactory]: Interpolants [1655#true, 1656#false, 1657#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1658#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1659#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1660#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0)))), 1661#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base))), 1662#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0) 8) (select |#length| SelectionSort_~a.base)))] [2018-02-04 15:05:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:05:59,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:05:59,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:05:59,275 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 8 states. [2018-02-04 15:05:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:59,459 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-04 15:05:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:05:59,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-04 15:05:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:59,460 INFO L225 Difference]: With dead ends: 88 [2018-02-04 15:05:59,460 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 15:05:59,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:05:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 15:05:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-02-04 15:05:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 15:05:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-04 15:05:59,461 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 40 [2018-02-04 15:05:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:59,462 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-04 15:05:59,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:05:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-04 15:05:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 15:05:59,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:59,462 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:59,462 INFO L371 AbstractCegarLoop]: === Iteration 13 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -523184295, now seen corresponding path program 3 times [2018-02-04 15:05:59,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:59,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:59,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:05:59,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,518 INFO L182 omatonBuilderFactory]: Interpolants [1824#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 1825#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 3)), 1826#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 2)), 1827#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 1828#(<= SelectionSort_~array_size SelectionSort_~j~0), 1820#true, 1821#false, 1822#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 1823#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-04 15:05:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:05:59,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:05:59,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:05:59,519 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 9 states. [2018-02-04 15:05:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:59,574 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-04 15:05:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:05:59,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 15:05:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:59,575 INFO L225 Difference]: With dead ends: 90 [2018-02-04 15:05:59,575 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 15:05:59,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:05:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 15:05:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-02-04 15:05:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 15:05:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-02-04 15:05:59,577 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 45 [2018-02-04 15:05:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:59,577 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-02-04 15:05:59,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:05:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-02-04 15:05:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 15:05:59,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:59,577 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:59,578 INFO L371 AbstractCegarLoop]: === Iteration 14 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2058288955, now seen corresponding path program 4 times [2018-02-04 15:05:59,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:59,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:59,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:05:59,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,647 INFO L182 omatonBuilderFactory]: Interpolants [1989#true, 1990#false, 1991#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1992#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1993#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 1994#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 16) (select |#length| SelectionSort_~a.base)), 1995#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1996#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 1997#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 1998#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:05:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:05:59,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:05:59,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:05:59,647 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 10 states. [2018-02-04 15:05:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:59,771 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-02-04 15:05:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:05:59,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-04 15:05:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:59,771 INFO L225 Difference]: With dead ends: 66 [2018-02-04 15:05:59,771 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 15:05:59,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:05:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 15:05:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-02-04 15:05:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 15:05:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-04 15:05:59,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2018-02-04 15:05:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:59,774 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-04 15:05:59,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:05:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-04 15:05:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 15:05:59,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:59,775 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:05:59,775 INFO L371 AbstractCegarLoop]: === Iteration 15 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:05:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash -91466215, now seen corresponding path program 5 times [2018-02-04 15:05:59,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:59,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:59,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 15:05:59,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,843 INFO L182 omatonBuilderFactory]: Interpolants [2144#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 2145#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2146#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2147#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 4)), 2148#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 3)), 2149#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2150#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2151#(<= SelectionSort_~array_size SelectionSort_~j~0), 2141#true, 2142#false, 2143#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1))] [2018-02-04 15:05:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:59,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:05:59,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:05:59,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:05:59,844 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 11 states. [2018-02-04 15:05:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:59,995 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-02-04 15:05:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:05:59,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-04 15:05:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:59,997 INFO L225 Difference]: With dead ends: 108 [2018-02-04 15:05:59,997 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 15:05:59,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:05:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 15:05:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-02-04 15:05:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 15:05:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-02-04 15:06:00,000 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 57 [2018-02-04 15:06:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:00,000 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-02-04 15:06:00,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:06:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-02-04 15:06:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 15:06:00,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:00,001 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:00,001 INFO L371 AbstractCegarLoop]: === Iteration 16 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2052963717, now seen corresponding path program 6 times [2018-02-04 15:06:00,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:00,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 29 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:00,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 15:06:00,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,123 INFO L182 omatonBuilderFactory]: Interpolants [2352#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 2353#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 2354#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2355#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2344#true, 2345#false, 2346#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 2347#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 2348#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 2349#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 2350#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 20) (select |#length| SelectionSort_~a.base)), 2351#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 16) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:06:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 29 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:06:00,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:06:00,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:06:00,124 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2018-02-04 15:06:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:00,341 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-02-04 15:06:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:06:00,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-04 15:06:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:00,341 INFO L225 Difference]: With dead ends: 78 [2018-02-04 15:06:00,341 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 15:06:00,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:06:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 15:06:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-02-04 15:06:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 15:06:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-02-04 15:06:00,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 63 [2018-02-04 15:06:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:00,343 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-02-04 15:06:00,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:06:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-02-04 15:06:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 15:06:00,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:00,344 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:00,344 INFO L371 AbstractCegarLoop]: === Iteration 17 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1228373287, now seen corresponding path program 7 times [2018-02-04 15:06:00,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:00,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:00,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:06:00,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,441 INFO L182 omatonBuilderFactory]: Interpolants [2528#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2529#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2530#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 2531#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 5)), 2532#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 4)), 2533#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 2534#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2535#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2536#(<= SelectionSort_~array_size SelectionSort_~j~0), 2524#true, 2525#false, 2526#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 2527#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-04 15:06:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:06:00,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:06:00,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:06:00,442 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 13 states. [2018-02-04 15:06:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:00,561 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-04 15:06:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:06:00,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-02-04 15:06:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:00,562 INFO L225 Difference]: With dead ends: 126 [2018-02-04 15:06:00,562 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 15:06:00,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:06:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 15:06:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-02-04 15:06:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 15:06:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-04 15:06:00,565 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 69 [2018-02-04 15:06:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:00,565 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-04 15:06:00,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:06:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-04 15:06:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 15:06:00,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:00,566 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:00,566 INFO L371 AbstractCegarLoop]: === Iteration 18 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1543383109, now seen corresponding path program 8 times [2018-02-04 15:06:00,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:00,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:00,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:06:00,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,700 INFO L182 omatonBuilderFactory]: Interpolants [2761#true, 2762#false, 2763#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 2764#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 2765#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 2766#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 2767#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 2768#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 24) (select |#length| SelectionSort_~a.base)), 2769#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 20) (select |#length| SelectionSort_~a.base)), 2770#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 2771#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 2772#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 2773#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2774#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:00,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:06:00,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:06:00,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:06:00,701 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 14 states. [2018-02-04 15:06:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:00,934 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-04 15:06:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:06:00,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2018-02-04 15:06:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:00,935 INFO L225 Difference]: With dead ends: 90 [2018-02-04 15:06:00,935 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 15:06:00,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:06:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 15:06:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-02-04 15:06:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 15:06:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-02-04 15:06:00,937 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 75 [2018-02-04 15:06:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:00,938 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-02-04 15:06:00,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:06:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-02-04 15:06:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 15:06:00,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:00,939 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:00,939 INFO L371 AbstractCegarLoop]: === Iteration 19 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash -509747815, now seen corresponding path program 9 times [2018-02-04 15:06:00,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:00,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 55 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:01,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:06:01,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,062 INFO L182 omatonBuilderFactory]: Interpolants [2976#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 2977#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 6)), 2978#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 5)), 2979#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 2980#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 2981#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2982#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2983#(<= SelectionSort_~array_size SelectionSort_~j~0), 2969#true, 2970#false, 2971#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 2972#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 2973#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2974#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2975#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-04 15:06:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 55 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:06:01,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:06:01,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:06:01,063 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 15 states. [2018-02-04 15:06:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:01,201 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-04 15:06:01,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:06:01,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-02-04 15:06:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:01,202 INFO L225 Difference]: With dead ends: 144 [2018-02-04 15:06:01,202 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 15:06:01,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:06:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 15:06:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-02-04 15:06:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 15:06:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-02-04 15:06:01,204 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 81 [2018-02-04 15:06:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:01,204 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-02-04 15:06:01,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:06:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-02-04 15:06:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 15:06:01,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:01,205 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:01,205 INFO L371 AbstractCegarLoop]: === Iteration 20 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1909113093, now seen corresponding path program 10 times [2018-02-04 15:06:01,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:01,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 77 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:01,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:06:01,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,385 INFO L182 omatonBuilderFactory]: Interpolants [3240#true, 3241#false, 3242#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 3243#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 3244#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 3245#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 3246#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 3247#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 3248#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 28) (select |#length| SelectionSort_~a.base)), 3249#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 24) (select |#length| SelectionSort_~a.base)), 3250#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 3251#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 3252#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 3253#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 3254#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 3255#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 77 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:06:01,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:06:01,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:06:01,385 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 16 states. [2018-02-04 15:06:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:01,779 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-02-04 15:06:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:06:01,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-02-04 15:06:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:01,780 INFO L225 Difference]: With dead ends: 102 [2018-02-04 15:06:01,780 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 15:06:01,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:06:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 15:06:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-02-04 15:06:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 15:06:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-02-04 15:06:01,782 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 87 [2018-02-04 15:06:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:01,782 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-02-04 15:06:01,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:06:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-02-04 15:06:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 15:06:01,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:01,782 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:01,782 INFO L371 AbstractCegarLoop]: === Iteration 21 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash -834345383, now seen corresponding path program 11 times [2018-02-04 15:06:01,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:01,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 83 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:01,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:06:01,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,904 INFO L182 omatonBuilderFactory]: Interpolants [3488#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 3489#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 3490#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 3491#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 3492#(<= SelectionSort_~array_size SelectionSort_~j~0), 3476#true, 3477#false, 3478#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 3479#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 3480#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 3481#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 3482#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 3483#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 3484#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 3485#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 7)), 3486#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 6)), 3487#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-04 15:06:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 83 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:01,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 15:06:01,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 15:06:01,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:06:01,905 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 17 states. [2018-02-04 15:06:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:02,018 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 15:06:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:06:02,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-04 15:06:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:02,019 INFO L225 Difference]: With dead ends: 162 [2018-02-04 15:06:02,019 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 15:06:02,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:06:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 15:06:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-02-04 15:06:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 15:06:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2018-02-04 15:06:02,021 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 93 [2018-02-04 15:06:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:02,021 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2018-02-04 15:06:02,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 15:06:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2018-02-04 15:06:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 15:06:02,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:02,022 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 12, 12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:02,022 INFO L371 AbstractCegarLoop]: === Iteration 22 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1249642437, now seen corresponding path program 12 times [2018-02-04 15:06:02,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:02,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 110 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:02,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:06:02,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,211 INFO L182 omatonBuilderFactory]: Interpolants [3781#true, 3782#false, 3783#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 3784#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 3785#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 3786#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 3787#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 3788#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 3789#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 3790#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 32) (select |#length| SelectionSort_~a.base)), 3791#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 28) (select |#length| SelectionSort_~a.base)), 3792#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 3793#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 3794#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 3795#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 3796#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 3797#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 3798#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 110 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:06:02,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:06:02,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:06:02,212 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 18 states. [2018-02-04 15:06:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:02,628 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-02-04 15:06:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 15:06:02,630 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-04 15:06:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:02,630 INFO L225 Difference]: With dead ends: 114 [2018-02-04 15:06:02,630 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 15:06:02,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:06:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 15:06:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-02-04 15:06:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 15:06:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-02-04 15:06:02,632 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 99 [2018-02-04 15:06:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:02,632 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-02-04 15:06:02,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:06:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-02-04 15:06:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 15:06:02,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:02,633 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 13, 13, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:02,633 INFO L371 AbstractCegarLoop]: === Iteration 23 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1058413849, now seen corresponding path program 13 times [2018-02-04 15:06:02,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:02,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 117 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:02,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 15:06:02,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,806 INFO L182 omatonBuilderFactory]: Interpolants [4045#true, 4046#false, 4047#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 4048#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 4049#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 4050#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 4051#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 4052#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 4053#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 4054#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 4055#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 8)), 4056#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 7)), 4057#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 4058#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 4059#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 4060#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 4061#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 4062#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 4063#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 117 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:06:02,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:06:02,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:06:02,807 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 19 states. [2018-02-04 15:06:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:02,967 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2018-02-04 15:06:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 15:06:02,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2018-02-04 15:06:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:02,968 INFO L225 Difference]: With dead ends: 180 [2018-02-04 15:06:02,968 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 15:06:02,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:06:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 15:06:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-02-04 15:06:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 15:06:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-02-04 15:06:02,970 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 105 [2018-02-04 15:06:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:02,970 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-02-04 15:06:02,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:06:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-02-04 15:06:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 15:06:02,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:02,971 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 14, 14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:02,971 INFO L371 AbstractCegarLoop]: === Iteration 24 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1544913787, now seen corresponding path program 14 times [2018-02-04 15:06:02,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:02,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 149 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:03,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 15:06:03,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,214 INFO L182 omatonBuilderFactory]: Interpolants [4384#true, 4385#false, 4386#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 4387#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 4388#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 4389#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 4390#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 4391#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 4392#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 4393#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 4394#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 36) (select |#length| SelectionSort_~a.base)), 4395#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 32) (select |#length| SelectionSort_~a.base)), 4396#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 4397#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 4398#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 4399#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 4400#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 4401#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 4402#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 4403#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 149 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 15:06:03,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 15:06:03,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-04 15:06:03,215 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 20 states. [2018-02-04 15:06:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:03,669 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-04 15:06:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 15:06:03,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-02-04 15:06:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:03,670 INFO L225 Difference]: With dead ends: 126 [2018-02-04 15:06:03,670 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 15:06:03,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:06:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 15:06:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-02-04 15:06:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 15:06:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-02-04 15:06:03,672 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 111 [2018-02-04 15:06:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:03,672 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-02-04 15:06:03,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 15:06:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-02-04 15:06:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 15:06:03,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:03,672 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:03,673 INFO L371 AbstractCegarLoop]: === Iteration 25 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1300890073, now seen corresponding path program 15 times [2018-02-04 15:06:03,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:03,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 157 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:03,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 15:06:03,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,854 INFO L182 omatonBuilderFactory]: Interpolants [4676#true, 4677#false, 4678#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 4679#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 4680#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 4681#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 4682#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 4683#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 4684#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 4685#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 4686#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 4687#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 9)), 4688#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 8)), 4689#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 4690#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 4691#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 4692#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 4693#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 4694#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 4695#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 4696#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 157 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:03,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 15:06:03,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 15:06:03,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:06:03,855 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 21 states. [2018-02-04 15:06:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:04,005 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-04 15:06:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:06:04,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-02-04 15:06:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:04,005 INFO L225 Difference]: With dead ends: 198 [2018-02-04 15:06:04,006 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 15:06:04,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:06:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 15:06:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2018-02-04 15:06:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 15:06:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-02-04 15:06:04,007 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 117 [2018-02-04 15:06:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:04,008 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-02-04 15:06:04,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 15:06:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-02-04 15:06:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 15:06:04,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:04,008 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:04,008 INFO L371 AbstractCegarLoop]: === Iteration 26 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1393467205, now seen corresponding path program 16 times [2018-02-04 15:06:04,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:04,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 194 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:04,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 15:06:04,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,195 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 5057#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 5058#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 5059#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 5060#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 40) (select |#length| SelectionSort_~a.base)), 5061#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 36) (select |#length| SelectionSort_~a.base)), 5062#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 5063#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 5064#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 5065#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 5066#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 5067#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 5068#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 5069#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5070#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5049#true, 5050#false, 5051#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 5052#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 5053#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 5054#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 5055#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0)] [2018-02-04 15:06:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 194 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:06:04,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:06:04,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:06:04,196 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 22 states. [2018-02-04 15:06:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:04,640 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-02-04 15:06:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:06:04,641 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2018-02-04 15:06:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:04,641 INFO L225 Difference]: With dead ends: 138 [2018-02-04 15:06:04,641 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 15:06:04,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:06:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 15:06:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-02-04 15:06:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 15:06:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2018-02-04 15:06:04,644 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 123 [2018-02-04 15:06:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:04,644 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2018-02-04 15:06:04,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:06:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2018-02-04 15:06:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 15:06:04,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:04,645 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 17, 17, 17, 17, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:04,645 INFO L371 AbstractCegarLoop]: === Iteration 27 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1379472537, now seen corresponding path program 17 times [2018-02-04 15:06:04,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:04,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 203 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:04,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 15:06:04,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,872 INFO L182 omatonBuilderFactory]: Interpolants [5376#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 5377#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 5378#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 5379#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 5380#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 5381#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 10)), 5382#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 9)), 5383#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 5384#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 5385#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 5386#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 5387#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 5388#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 5389#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 5390#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 5391#(<= SelectionSort_~array_size SelectionSort_~j~0), 5369#true, 5370#false, 5371#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 5372#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 5373#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 5374#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 5375#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-04 15:06:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 203 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:04,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 15:06:04,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 15:06:04,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-02-04 15:06:04,873 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand 23 states. [2018-02-04 15:06:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:05,103 INFO L93 Difference]: Finished difference Result 216 states and 250 transitions. [2018-02-04 15:06:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 15:06:05,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-02-04 15:06:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:05,104 INFO L225 Difference]: With dead ends: 216 [2018-02-04 15:06:05,104 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 15:06:05,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:06:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 15:06:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-04 15:06:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 15:06:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-02-04 15:06:05,106 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 129 [2018-02-04 15:06:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:05,106 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-02-04 15:06:05,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 15:06:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2018-02-04 15:06:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-04 15:06:05,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:05,107 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 18, 18, 18, 18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:05,107 INFO L371 AbstractCegarLoop]: === Iteration 28 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 738258949, now seen corresponding path program 18 times [2018-02-04 15:06:05,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:05,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 245 proven. 767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:05,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:05,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 15:06:05,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:05,416 INFO L182 omatonBuilderFactory]: Interpolants [5792#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 5793#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 5794#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 5795#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 5796#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 5797#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 5798#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5799#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5776#true, 5777#false, 5778#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 5779#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 5780#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 5781#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 5782#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 5783#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 5784#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 5785#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 5786#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 5787#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 5788#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 44) (select |#length| SelectionSort_~a.base)), 5789#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 40) (select |#length| SelectionSort_~a.base)), 5790#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 5791#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:06:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 245 proven. 767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:05,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 15:06:05,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 15:06:05,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:06:05,417 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 24 states. [2018-02-04 15:06:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:05,899 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2018-02-04 15:06:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:06:05,899 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-02-04 15:06:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:05,899 INFO L225 Difference]: With dead ends: 150 [2018-02-04 15:06:05,899 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 15:06:05,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:06:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 15:06:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-02-04 15:06:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 15:06:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-02-04 15:06:05,902 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 135 [2018-02-04 15:06:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:05,903 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-02-04 15:06:05,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 15:06:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-02-04 15:06:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 15:06:05,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:05,903 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 19, 19, 19, 19, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:05,904 INFO L371 AbstractCegarLoop]: === Iteration 29 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -858008231, now seen corresponding path program 19 times [2018-02-04 15:06:05,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:05,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 255 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:06,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:06:06,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,195 INFO L182 omatonBuilderFactory]: Interpolants [6144#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 6145#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 6146#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 6147#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 6148#(<= SelectionSort_~array_size SelectionSort_~j~0), 6124#true, 6125#false, 6126#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 6127#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 6128#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 6129#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 6130#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 6131#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 6132#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 6133#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 6134#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 6135#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 6136#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 6137#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 11)), 6138#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 10)), 6139#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 6140#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 6141#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 6142#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 6143#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-04 15:06:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 255 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 15:06:06,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 15:06:06,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:06:06,196 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 25 states. [2018-02-04 15:06:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:06,464 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-04 15:06:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:06:06,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-02-04 15:06:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:06,465 INFO L225 Difference]: With dead ends: 234 [2018-02-04 15:06:06,465 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 15:06:06,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:06:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 15:06:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2018-02-04 15:06:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 15:06:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2018-02-04 15:06:06,468 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 141 [2018-02-04 15:06:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:06,468 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2018-02-04 15:06:06,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 15:06:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2018-02-04 15:06:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 15:06:06,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:06,468 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 20, 20, 20, 20, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:06,468 INFO L371 AbstractCegarLoop]: === Iteration 30 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash -369496379, now seen corresponding path program 20 times [2018-02-04 15:06:06,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:06,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 302 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:06,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:06:06,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,755 INFO L182 omatonBuilderFactory]: Interpolants [6565#true, 6566#false, 6567#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 6568#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 6569#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 6570#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 6571#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 6572#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 6573#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 6574#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 6575#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 6576#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 6577#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 6578#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 48) (select |#length| SelectionSort_~a.base)), 6579#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 44) (select |#length| SelectionSort_~a.base)), 6580#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 6581#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 6582#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 6583#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 6584#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 6585#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 6586#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 6587#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 6588#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 6589#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 6590#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 302 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:06:06,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:06:06,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:06:06,756 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand 26 states. [2018-02-04 15:06:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:07,442 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 15:06:07,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 15:06:07,442 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2018-02-04 15:06:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:07,443 INFO L225 Difference]: With dead ends: 162 [2018-02-04 15:06:07,443 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 15:06:07,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:06:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 15:06:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-02-04 15:06:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 15:06:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2018-02-04 15:06:07,446 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 147 [2018-02-04 15:06:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:07,446 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2018-02-04 15:06:07,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:06:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2018-02-04 15:06:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 15:06:07,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:07,447 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 21, 21, 21, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:07,447 INFO L371 AbstractCegarLoop]: === Iteration 31 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1279968281, now seen corresponding path program 21 times [2018-02-04 15:06:07,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:07,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 313 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:07,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:07,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 15:06:07,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:07,766 INFO L182 omatonBuilderFactory]: Interpolants [6941#true, 6942#false, 6943#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 6944#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 6945#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 6946#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 6947#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 6948#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 6949#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 6950#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 6951#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 6952#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 6953#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 6954#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 6955#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 12)), 6956#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 11)), 6957#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 6958#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 6959#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 6960#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 6961#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 6962#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 6963#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 6964#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 6965#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 6966#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 6967#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 313 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:07,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 15:06:07,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 15:06:07,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:06:07,768 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand 27 states. [2018-02-04 15:06:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:08,045 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2018-02-04 15:06:08,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 15:06:08,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2018-02-04 15:06:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:08,046 INFO L225 Difference]: With dead ends: 252 [2018-02-04 15:06:08,046 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 15:06:08,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:06:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 15:06:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-04 15:06:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 15:06:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2018-02-04 15:06:08,048 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 153 [2018-02-04 15:06:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:08,048 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2018-02-04 15:06:08,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 15:06:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2018-02-04 15:06:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 15:06:08,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:08,049 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:08,049 INFO L371 AbstractCegarLoop]: === Iteration 32 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 391256965, now seen corresponding path program 22 times [2018-02-04 15:06:08,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:08,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 365 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:08,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:08,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 15:06:08,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:08,329 INFO L182 omatonBuilderFactory]: Interpolants [7424#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 7425#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 7426#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 7427#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 7428#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 7429#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 7430#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 52) (select |#length| SelectionSort_~a.base)), 7431#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 48) (select |#length| SelectionSort_~a.base)), 7432#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 7433#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 7434#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 7435#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 7436#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 7437#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 7438#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 7439#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 7440#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 7441#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 7442#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 7443#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 7416#true, 7417#false, 7418#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 7419#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 7420#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 7421#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 7422#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 7423#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0)] [2018-02-04 15:06:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 365 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:08,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 15:06:08,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 15:06:08,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:06:08,330 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand 28 states. [2018-02-04 15:06:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:09,024 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2018-02-04 15:06:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 15:06:09,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 159 [2018-02-04 15:06:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:09,025 INFO L225 Difference]: With dead ends: 174 [2018-02-04 15:06:09,025 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 15:06:09,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:06:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 15:06:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-02-04 15:06:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 15:06:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2018-02-04 15:06:09,028 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 159 [2018-02-04 15:06:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:09,028 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2018-02-04 15:06:09,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 15:06:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2018-02-04 15:06:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 15:06:09,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:09,029 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 23, 23, 23, 23, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:09,029 INFO L371 AbstractCegarLoop]: === Iteration 33 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1451122905, now seen corresponding path program 23 times [2018-02-04 15:06:09,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:09,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 377 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:09,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 15:06:09,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,352 INFO L182 omatonBuilderFactory]: Interpolants [7820#true, 7821#false, 7822#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 7823#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 7824#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 7825#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 7826#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 7827#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 7828#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 7829#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 7830#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 7831#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 7832#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 7833#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 7834#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 7835#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 13)), 7836#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 12)), 7837#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 7838#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 7839#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 7840#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 7841#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 7842#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 7843#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 7844#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 7845#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 7846#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 7847#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 7848#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 377 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 15:06:09,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 15:06:09,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:06:09,353 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand 29 states. [2018-02-04 15:06:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:09,638 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-04 15:06:09,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 15:06:09,639 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 165 [2018-02-04 15:06:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:09,640 INFO L225 Difference]: With dead ends: 270 [2018-02-04 15:06:09,640 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 15:06:09,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:06:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 15:06:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 183. [2018-02-04 15:06:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 15:06:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-02-04 15:06:09,643 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 165 [2018-02-04 15:06:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:09,643 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-02-04 15:06:09,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 15:06:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-02-04 15:06:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-04 15:06:09,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:09,644 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 24, 24, 24, 24, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:09,644 INFO L371 AbstractCegarLoop]: === Iteration 34 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash -176032187, now seen corresponding path program 24 times [2018-02-04 15:06:09,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:09,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 434 proven. 1346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:09,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 15:06:09,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,969 INFO L182 omatonBuilderFactory]: Interpolants [8329#true, 8330#false, 8331#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 8332#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 8333#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 8334#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 8335#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 8336#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 8337#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 8338#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 8339#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 8340#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 8341#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 8342#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 8343#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 8344#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 56) (select |#length| SelectionSort_~a.base)), 8345#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 52) (select |#length| SelectionSort_~a.base)), 8346#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 8347#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 8348#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 8349#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 8350#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 8351#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 8352#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 8353#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 8354#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 8355#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 8356#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 8357#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 8358#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 434 proven. 1346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 15:06:09,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 15:06:09,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:06:09,970 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 30 states. [2018-02-04 15:06:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:10,696 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2018-02-04 15:06:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 15:06:10,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 171 [2018-02-04 15:06:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:10,697 INFO L225 Difference]: With dead ends: 186 [2018-02-04 15:06:10,697 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 15:06:10,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:06:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 15:06:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-02-04 15:06:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 15:06:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2018-02-04 15:06:10,698 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 171 [2018-02-04 15:06:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:10,699 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2018-02-04 15:06:10,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 15:06:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2018-02-04 15:06:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 15:06:10,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:10,699 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 25, 25, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:10,699 INFO L371 AbstractCegarLoop]: === Iteration 35 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1351560089, now seen corresponding path program 25 times [2018-02-04 15:06:10,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:10,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 447 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:11,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 15:06:11,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,022 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 8769#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 8770#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 8771#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 8772#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 8773#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 8774#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 8775#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 8776#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 8777#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 14)), 8778#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 13)), 8779#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 8780#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 8781#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 8782#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 8783#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 8784#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 8785#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 8786#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 8787#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 8788#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 8789#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 8790#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 8791#(<= SelectionSort_~array_size SelectionSort_~j~0), 8761#true, 8762#false, 8763#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 8764#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 8765#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 8766#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 8767#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-04 15:06:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 447 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 15:06:11,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 15:06:11,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:06:11,023 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 31 states. [2018-02-04 15:06:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:11,319 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2018-02-04 15:06:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 15:06:11,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 177 [2018-02-04 15:06:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:11,320 INFO L225 Difference]: With dead ends: 288 [2018-02-04 15:06:11,320 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 15:06:11,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:06:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 15:06:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 195. [2018-02-04 15:06:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 15:06:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2018-02-04 15:06:11,324 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 177 [2018-02-04 15:06:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:11,324 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2018-02-04 15:06:11,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 15:06:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2018-02-04 15:06:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 15:06:11,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:11,325 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 26, 26, 26, 26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:11,325 INFO L371 AbstractCegarLoop]: === Iteration 36 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1696726789, now seen corresponding path program 26 times [2018-02-04 15:06:11,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:11,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 509 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:11,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 15:06:11,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,703 INFO L182 omatonBuilderFactory]: Interpolants [9304#true, 9305#false, 9306#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 9307#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 9308#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 9309#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 9310#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 9311#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 9312#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 9313#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 9314#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 9315#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 9316#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 9317#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 9318#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 9319#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 9320#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 60) (select |#length| SelectionSort_~a.base)), 9321#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 56) (select |#length| SelectionSort_~a.base)), 9322#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 9323#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 9324#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 9325#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 9326#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 9327#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 9328#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 9329#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 9330#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 9331#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 9332#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 9333#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 9334#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 9335#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 509 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:11,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 15:06:11,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 15:06:11,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:06:11,704 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand 32 states. [2018-02-04 15:06:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:12,504 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-04 15:06:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 15:06:12,504 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-02-04 15:06:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:12,505 INFO L225 Difference]: With dead ends: 198 [2018-02-04 15:06:12,505 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 15:06:12,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1828, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:06:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 15:06:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-02-04 15:06:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 15:06:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 226 transitions. [2018-02-04 15:06:12,508 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 226 transitions. Word has length 183 [2018-02-04 15:06:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:12,509 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 226 transitions. [2018-02-04 15:06:12,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 15:06:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 226 transitions. [2018-02-04 15:06:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 15:06:12,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:12,510 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 27, 27, 27, 27, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:12,510 INFO L371 AbstractCegarLoop]: === Iteration 37 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1723180121, now seen corresponding path program 27 times [2018-02-04 15:06:12,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:12,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 523 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:12,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 15:06:12,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,850 INFO L182 omatonBuilderFactory]: Interpolants [9792#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 9793#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 9794#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 9795#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 9796#(<= SelectionSort_~array_size SelectionSort_~j~0), 9764#true, 9765#false, 9766#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 9767#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 9768#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 9769#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 9770#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 9771#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 9772#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 9773#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 9774#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 9775#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 9776#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 9777#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 9778#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 9779#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 9780#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 9781#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 15)), 9782#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 14)), 9783#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 9784#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 9785#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 9786#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 9787#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 9788#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 9789#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 9790#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 9791#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-04 15:06:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 523 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 15:06:12,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 15:06:12,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:06:12,850 INFO L87 Difference]: Start difference. First operand 195 states and 226 transitions. Second operand 33 states. [2018-02-04 15:06:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:13,152 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-04 15:06:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 15:06:13,152 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 189 [2018-02-04 15:06:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:13,153 INFO L225 Difference]: With dead ends: 306 [2018-02-04 15:06:13,153 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 15:06:13,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=559, Invalid=1697, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:06:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 15:06:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2018-02-04 15:06:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 15:06:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-02-04 15:06:13,155 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 189 [2018-02-04 15:06:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:13,155 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-02-04 15:06:13,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 15:06:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-02-04 15:06:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 15:06:13,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:13,156 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 28, 28, 28, 28, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:13,156 INFO L371 AbstractCegarLoop]: === Iteration 38 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -840256059, now seen corresponding path program 28 times [2018-02-04 15:06:13,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:13,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 590 proven. 1822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:13,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:13,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 15:06:13,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:13,582 INFO L182 omatonBuilderFactory]: Interpolants [10368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 10369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 10370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 10371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 10372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 10373#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 10374#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 10341#true, 10342#false, 10343#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 10344#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 10345#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 10346#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 10347#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 10348#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 10349#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 10350#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 10351#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 10352#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 10353#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 10354#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 10355#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 10356#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 10357#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 10358#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 64) (select |#length| SelectionSort_~a.base)), 10359#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 60) (select |#length| SelectionSort_~a.base)), 10360#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 10361#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 10362#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 10363#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 10364#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 10365#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 10366#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 10367#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:06:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 590 proven. 1822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:13,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 15:06:13,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 15:06:13,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:06:13,582 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 34 states. [2018-02-04 15:06:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:14,259 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2018-02-04 15:06:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 15:06:14,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 195 [2018-02-04 15:06:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:14,260 INFO L225 Difference]: With dead ends: 210 [2018-02-04 15:06:14,260 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 15:06:14,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=590, Invalid=2062, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:06:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 15:06:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-02-04 15:06:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 15:06:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 240 transitions. [2018-02-04 15:06:14,262 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 240 transitions. Word has length 195 [2018-02-04 15:06:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:14,262 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 240 transitions. [2018-02-04 15:06:14,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 15:06:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 240 transitions. [2018-02-04 15:06:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 15:06:14,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:14,263 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 29, 29, 29, 29, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:14,263 INFO L371 AbstractCegarLoop]: === Iteration 39 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1951025945, now seen corresponding path program 29 times [2018-02-04 15:06:14,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:14,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2585 backedges. 605 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:14,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:14,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 15:06:14,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:14,656 INFO L182 omatonBuilderFactory]: Interpolants [10829#true, 10830#false, 10831#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 10832#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 10833#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 10834#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 10835#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 10836#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 10837#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 10838#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 10839#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 10840#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 10841#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 10842#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 10843#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 10844#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 10845#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 10846#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 10847#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 16)), 10848#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 15)), 10849#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 10850#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 10851#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 10852#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 10853#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 10854#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 10855#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 10856#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 10857#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 10858#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 10859#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 10860#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 10861#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 10862#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 10863#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2585 backedges. 605 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:14,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 15:06:14,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 15:06:14,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:06:14,657 INFO L87 Difference]: Start difference. First operand 207 states and 240 transitions. Second operand 35 states. [2018-02-04 15:06:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:15,004 INFO L93 Difference]: Finished difference Result 324 states and 376 transitions. [2018-02-04 15:06:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 15:06:15,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 201 [2018-02-04 15:06:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:15,004 INFO L225 Difference]: With dead ends: 324 [2018-02-04 15:06:15,005 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 15:06:15,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:06:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 15:06:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-04 15:06:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 15:06:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2018-02-04 15:06:15,007 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 201 [2018-02-04 15:06:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:15,008 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2018-02-04 15:06:15,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 15:06:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2018-02-04 15:06:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 15:06:15,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:15,009 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 30, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:15,009 INFO L371 AbstractCegarLoop]: === Iteration 40 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash 112499333, now seen corresponding path program 30 times [2018-02-04 15:06:15,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:15,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2764 backedges. 677 proven. 2087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:15,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:15,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 15:06:15,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:15,434 INFO L182 omatonBuilderFactory]: Interpolants [11456#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 11457#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 11458#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 68) (select |#length| SelectionSort_~a.base)), 11459#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 64) (select |#length| SelectionSort_~a.base)), 11460#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 11461#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 11462#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 11463#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 11464#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 11465#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 11466#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 11467#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 11468#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 11469#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 11470#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 11471#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 11472#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 11473#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 11474#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 11475#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 11440#true, 11441#false, 11442#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 11443#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 11444#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 11445#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 11446#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 11447#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 11448#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 11449#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 11450#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 11451#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 11452#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 11453#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 11454#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 11455#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0)] [2018-02-04 15:06:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2764 backedges. 677 proven. 2087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:15,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 15:06:15,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 15:06:15,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:06:15,434 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 36 states. [2018-02-04 15:06:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:16,473 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2018-02-04 15:06:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 15:06:16,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-02-04 15:06:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:16,474 INFO L225 Difference]: With dead ends: 222 [2018-02-04 15:06:16,474 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 15:06:16,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=660, Invalid=2310, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:06:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 15:06:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2018-02-04 15:06:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 15:06:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-02-04 15:06:16,477 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 207 [2018-02-04 15:06:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:16,478 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-02-04 15:06:16,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 15:06:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-02-04 15:06:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 15:06:16,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:16,479 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 31, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:16,479 INFO L371 AbstractCegarLoop]: === Iteration 41 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash -339370023, now seen corresponding path program 31 times [2018-02-04 15:06:16,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:16,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2949 backedges. 693 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:16,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:16,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 15:06:16,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:16,857 INFO L182 omatonBuilderFactory]: Interpolants [11968#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 11969#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 11970#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 11971#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 11972#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 11973#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 11974#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 11975#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 17)), 11976#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 16)), 11977#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 11978#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 11979#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 11980#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 11981#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 11982#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 11983#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 11984#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 11985#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 11986#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 11987#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 11988#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 11989#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 11990#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 11991#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 11992#(<= SelectionSort_~array_size SelectionSort_~j~0), 11956#true, 11957#false, 11958#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 11959#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 11960#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 11961#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 11962#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 11963#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 11964#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 11965#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 11966#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 11967#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10))] [2018-02-04 15:06:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2949 backedges. 693 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:16,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 15:06:16,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 15:06:16,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:06:16,858 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand 37 states. [2018-02-04 15:06:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:17,188 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-04 15:06:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 15:06:17,188 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 213 [2018-02-04 15:06:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:17,189 INFO L225 Difference]: With dead ends: 342 [2018-02-04 15:06:17,189 INFO L226 Difference]: Without dead ends: 241 [2018-02-04 15:06:17,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=701, Invalid=2161, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:06:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-04 15:06:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2018-02-04 15:06:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 15:06:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-04 15:06:17,191 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 213 [2018-02-04 15:06:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:17,191 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-04 15:06:17,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 15:06:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-04 15:06:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-04 15:06:17,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:17,192 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:17,192 INFO L371 AbstractCegarLoop]: === Iteration 42 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:17,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1031286085, now seen corresponding path program 32 times [2018-02-04 15:06:17,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:17,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3140 backedges. 770 proven. 2370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:17,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:17,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 15:06:17,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:17,669 INFO L182 omatonBuilderFactory]: Interpolants [12608#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 12609#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 12610#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 12611#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 12612#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 12613#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 12614#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 12615#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 12616#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 12617#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 12618#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 12619#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 12620#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 72) (select |#length| SelectionSort_~a.base)), 12621#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 68) (select |#length| SelectionSort_~a.base)), 12622#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 12623#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 12624#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 12625#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 12626#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 12627#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 12628#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 12629#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 12630#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 12631#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 12632#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 12633#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 12634#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 12635#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 12636#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 12637#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 12638#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 12601#true, 12602#false, 12603#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 12604#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 12605#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 12606#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 12607#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0)] [2018-02-04 15:06:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3140 backedges. 770 proven. 2370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:17,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 15:06:17,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 15:06:17,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1090, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 15:06:17,670 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 38 states. [2018-02-04 15:06:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:18,785 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-04 15:06:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 15:06:18,785 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2018-02-04 15:06:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:18,786 INFO L225 Difference]: With dead ends: 234 [2018-02-04 15:06:18,786 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 15:06:18,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:06:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 15:06:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-02-04 15:06:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 15:06:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-04 15:06:18,789 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 219 [2018-02-04 15:06:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:18,789 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-04 15:06:18,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 15:06:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-04 15:06:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 15:06:18,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:18,790 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 33, 33, 33, 33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:18,790 INFO L371 AbstractCegarLoop]: === Iteration 43 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1094704487, now seen corresponding path program 33 times [2018-02-04 15:06:18,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:18,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 787 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:19,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 15:06:19,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,285 INFO L182 omatonBuilderFactory]: Interpolants [13145#true, 13146#false, 13147#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 13148#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 13149#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 13150#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 13151#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 13152#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 13153#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 13154#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 13155#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 13156#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 13157#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 13158#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 13159#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 13160#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 13161#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 13162#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 13163#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 13164#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 13165#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 18)), 13166#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 17)), 13167#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 13168#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 13169#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 13170#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 13171#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 13172#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 13173#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 13174#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 13175#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 13176#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 13177#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 13178#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 13179#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 13180#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 13181#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 13182#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 13183#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 787 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 15:06:19,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 15:06:19,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:06:19,286 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 39 states. [2018-02-04 15:06:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:19,723 INFO L93 Difference]: Finished difference Result 360 states and 418 transitions. [2018-02-04 15:06:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 15:06:19,723 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 225 [2018-02-04 15:06:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:19,724 INFO L225 Difference]: With dead ends: 360 [2018-02-04 15:06:19,724 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 15:06:19,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=778, Invalid=2414, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:06:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 15:06:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-02-04 15:06:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 15:06:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 283 transitions. [2018-02-04 15:06:19,727 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 283 transitions. Word has length 225 [2018-02-04 15:06:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:19,727 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 283 transitions. [2018-02-04 15:06:19,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 15:06:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 283 transitions. [2018-02-04 15:06:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-02-04 15:06:19,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:19,728 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 34, 34, 34, 34, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:19,728 INFO L371 AbstractCegarLoop]: === Iteration 44 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -548540923, now seen corresponding path program 34 times [2018-02-04 15:06:19,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:19,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 869 proven. 2671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:20,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:20,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 15:06:20,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:20,323 INFO L182 omatonBuilderFactory]: Interpolants [13824#true, 13825#false, 13826#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 13827#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 13828#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 13829#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 13830#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 13831#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 13832#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 13833#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 13834#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 13835#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 13836#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 13837#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 13838#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 13839#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 13840#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 13841#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 13842#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 13843#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 13844#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 76) (select |#length| SelectionSort_~a.base)), 13845#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 72) (select |#length| SelectionSort_~a.base)), 13846#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 13847#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 13848#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 13849#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 13850#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 13851#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 13852#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 13853#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 13854#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 13855#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 13856#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 13857#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 13858#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 13859#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 13860#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 13861#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 13862#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 13863#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 869 proven. 2671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:20,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 15:06:20,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 15:06:20,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:06:20,323 INFO L87 Difference]: Start difference. First operand 243 states and 283 transitions. Second operand 40 states. [2018-02-04 15:06:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:21,501 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2018-02-04 15:06:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 15:06:21,501 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 231 [2018-02-04 15:06:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:21,502 INFO L225 Difference]: With dead ends: 246 [2018-02-04 15:06:21,502 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 15:06:21,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:06:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 15:06:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-02-04 15:06:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 15:06:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 282 transitions. [2018-02-04 15:06:21,504 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 282 transitions. Word has length 231 [2018-02-04 15:06:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:21,505 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 282 transitions. [2018-02-04 15:06:21,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 15:06:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 282 transitions. [2018-02-04 15:06:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 15:06:21,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:21,506 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 35, 35, 35, 35, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:21,506 INFO L371 AbstractCegarLoop]: === Iteration 45 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1173508953, now seen corresponding path program 35 times [2018-02-04 15:06:21,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:21,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 887 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:22,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:22,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:06:22,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:22,000 INFO L182 omatonBuilderFactory]: Interpolants [14400#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 14401#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 14402#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 14403#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 14404#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 14405#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 14406#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 14407#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 14408#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 14409#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 14410#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 14411#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 14412#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 14413#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 14414#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 14415#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 14416#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 14417#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 19)), 14418#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 18)), 14419#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 14420#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 14421#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 14422#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 14423#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 14424#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 14425#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 14426#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 14427#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 14428#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 14429#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 14430#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 14431#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 14432#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 14433#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 14434#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 14435#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 14436#(<= SelectionSort_~array_size SelectionSort_~j~0), 14396#true, 14397#false, 14398#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 14399#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-04 15:06:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 887 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:22,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 15:06:22,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 15:06:22,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:06:22,001 INFO L87 Difference]: Start difference. First operand 243 states and 282 transitions. Second operand 41 states. [2018-02-04 15:06:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:22,435 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-04 15:06:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 15:06:22,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-02-04 15:06:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:22,436 INFO L225 Difference]: With dead ends: 378 [2018-02-04 15:06:22,436 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 15:06:22,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=859, Invalid=2681, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:06:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 15:06:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 255. [2018-02-04 15:06:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 15:06:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 297 transitions. [2018-02-04 15:06:22,439 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 297 transitions. Word has length 237 [2018-02-04 15:06:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:22,439 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 297 transitions. [2018-02-04 15:06:22,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 15:06:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 297 transitions. [2018-02-04 15:06:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-04 15:06:22,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:22,440 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 36, 36, 36, 36, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:22,440 INFO L371 AbstractCegarLoop]: === Iteration 46 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2140250939, now seen corresponding path program 36 times [2018-02-04 15:06:22,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:22,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3964 backedges. 974 proven. 2990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:23,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:06:23,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,072 INFO L182 omatonBuilderFactory]: Interpolants [15109#true, 15110#false, 15111#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 15112#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 15113#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 15114#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 15115#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 15116#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 15117#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 15118#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 15119#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 15120#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 15121#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 15122#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 15123#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 15124#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 15125#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 15126#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 15127#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 15128#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 15129#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 15130#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 80) (select |#length| SelectionSort_~a.base)), 15131#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 76) (select |#length| SelectionSort_~a.base)), 15132#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 15133#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 15134#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 15135#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 15136#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 15137#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 15138#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 15139#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 15140#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 15141#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 15142#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 15143#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 15144#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 15145#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 15146#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 15147#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 15148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 15149#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 15150#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3964 backedges. 974 proven. 2990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:06:23,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:06:23,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:06:23,072 INFO L87 Difference]: Start difference. First operand 255 states and 297 transitions. Second operand 42 states. [2018-02-04 15:06:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:24,402 INFO L93 Difference]: Finished difference Result 258 states and 299 transitions. [2018-02-04 15:06:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 15:06:24,403 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 243 [2018-02-04 15:06:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:24,403 INFO L225 Difference]: With dead ends: 258 [2018-02-04 15:06:24,403 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 15:06:24,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=894, Invalid=3138, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:06:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 15:06:24,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-02-04 15:06:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 15:06:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-02-04 15:06:24,405 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 243 [2018-02-04 15:06:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:24,405 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-02-04 15:06:24,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:06:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-02-04 15:06:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 15:06:24,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:24,406 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 37, 37, 37, 37, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:24,406 INFO L371 AbstractCegarLoop]: === Iteration 47 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 691319321, now seen corresponding path program 37 times [2018-02-04 15:06:24,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:24,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4185 backedges. 993 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:24,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:24,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 15:06:24,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:24,928 INFO L182 omatonBuilderFactory]: Interpolants [15744#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 15745#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 15746#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 15747#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 15748#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 15749#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 15750#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 15751#(<= SelectionSort_~array_size SelectionSort_~j~0), 15709#true, 15710#false, 15711#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 15712#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 15713#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 15714#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 15715#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 15716#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 15717#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 15718#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 15719#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 15720#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 15721#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 15722#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 15723#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 15724#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 15725#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 15726#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 15727#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 15728#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 15729#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 15730#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 15731#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 20)), 15732#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 19)), 15733#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 15734#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 15735#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 15736#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 15737#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 15738#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 15739#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 15740#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 15741#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 15742#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 15743#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8))] [2018-02-04 15:06:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4185 backedges. 993 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:24,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 15:06:24,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 15:06:24,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:06:24,929 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 43 states. [2018-02-04 15:06:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:25,435 INFO L93 Difference]: Finished difference Result 396 states and 460 transitions. [2018-02-04 15:06:25,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 15:06:25,435 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-04 15:06:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:25,436 INFO L225 Difference]: With dead ends: 396 [2018-02-04 15:06:25,436 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 15:06:25,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=944, Invalid=2962, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:06:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 15:06:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-02-04 15:06:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-04 15:06:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2018-02-04 15:06:25,438 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 249 [2018-02-04 15:06:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:25,438 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2018-02-04 15:06:25,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 15:06:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2018-02-04 15:06:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-04 15:06:25,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:25,439 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 38, 38, 38, 38, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:25,439 INFO L371 AbstractCegarLoop]: === Iteration 48 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1003357819, now seen corresponding path program 38 times [2018-02-04 15:06:25,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:25,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4412 backedges. 1085 proven. 3327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:26,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:26,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 15:06:26,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:26,087 INFO L182 omatonBuilderFactory]: Interpolants [16456#true, 16457#false, 16458#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 16459#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 16460#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 16461#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 16462#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 16463#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 16464#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 16465#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 16466#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 16467#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 16468#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 16469#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 16470#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 16471#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 16472#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 16473#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 16474#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 16475#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 16476#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 16477#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 16478#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 84) (select |#length| SelectionSort_~a.base)), 16479#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 80) (select |#length| SelectionSort_~a.base)), 16480#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 16481#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 16482#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 16483#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 16484#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 16485#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 16486#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 16487#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 16488#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 16489#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 16490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 16491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 16492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 16493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 16494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 16495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 16496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 16497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 16498#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 16499#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4412 backedges. 1085 proven. 3327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:26,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 15:06:26,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 15:06:26,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:06:26,088 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand 44 states. [2018-02-04 15:06:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:27,505 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-04 15:06:27,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 15:06:27,505 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2018-02-04 15:06:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:27,506 INFO L225 Difference]: With dead ends: 270 [2018-02-04 15:06:27,506 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 15:06:27,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=980, Invalid=3442, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:06:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 15:06:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-02-04 15:06:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-04 15:06:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions. [2018-02-04 15:06:27,508 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 255 [2018-02-04 15:06:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:27,508 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 310 transitions. [2018-02-04 15:06:27,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 15:06:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions. [2018-02-04 15:06:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-02-04 15:06:27,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:27,509 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 39, 39, 39, 39, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:27,509 INFO L371 AbstractCegarLoop]: === Iteration 49 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1199554265, now seen corresponding path program 39 times [2018-02-04 15:06:27,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:27,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 1105 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:28,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:28,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 15:06:28,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:28,307 INFO L182 omatonBuilderFactory]: Interpolants [17088#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 17089#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 17090#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 17091#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 17092#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 17093#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 17094#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 17095#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 17096#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 17097#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 17098#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 17099#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 17100#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 17101#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 17102#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 17103#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 17104#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 17105#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 17106#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 17107#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 21)), 17108#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 20)), 17109#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 17110#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 17111#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 17112#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 17113#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 17114#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 17115#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 17116#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 17117#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 17118#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 17119#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 17120#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 17121#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 17122#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 17123#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 17124#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 17125#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 17126#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 17127#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 17128#(<= SelectionSort_~array_size SelectionSort_~j~0), 17084#true, 17085#false, 17086#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 17087#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-04 15:06:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 1105 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:28,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 15:06:28,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 15:06:28,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=1492, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:06:28,308 INFO L87 Difference]: Start difference. First operand 267 states and 310 transitions. Second operand 45 states. [2018-02-04 15:06:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:28,770 INFO L93 Difference]: Finished difference Result 414 states and 481 transitions. [2018-02-04 15:06:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 15:06:28,770 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 261 [2018-02-04 15:06:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:28,771 INFO L225 Difference]: With dead ends: 414 [2018-02-04 15:06:28,771 INFO L226 Difference]: Without dead ends: 289 [2018-02-04 15:06:28,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 15:06:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-04 15:06:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2018-02-04 15:06:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 15:06:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 325 transitions. [2018-02-04 15:06:28,774 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 325 transitions. Word has length 261 [2018-02-04 15:06:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:28,774 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 325 transitions. [2018-02-04 15:06:28,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 15:06:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 325 transitions. [2018-02-04 15:06:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 15:06:28,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:28,775 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 40, 40, 40, 40, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:28,775 INFO L371 AbstractCegarLoop]: === Iteration 50 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1158759493, now seen corresponding path program 40 times [2018-02-04 15:06:28,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:28,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 1202 proven. 3682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:29,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:29,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 15:06:29,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:29,551 INFO L182 omatonBuilderFactory]: Interpolants [17865#true, 17866#false, 17867#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 17868#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 17869#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 17870#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 17871#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 17872#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 17873#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 17874#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 17875#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 17876#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 17877#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 17878#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 17879#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 17880#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 17881#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 17882#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 17883#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 17884#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 17885#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 17886#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 17887#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 17888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 88) (select |#length| SelectionSort_~a.base)), 17889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 84) (select |#length| SelectionSort_~a.base)), 17890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 17891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 17892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 17893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 17894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 17895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 17896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 17897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 17898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 17899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 17900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 17901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 17902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 17903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 17904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 17905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 17906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 17907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 17908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 17909#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 17910#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 1202 proven. 3682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:29,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 15:06:29,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 15:06:29,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:06:29,552 INFO L87 Difference]: Start difference. First operand 279 states and 325 transitions. Second operand 46 states. [2018-02-04 15:06:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:31,127 INFO L93 Difference]: Finished difference Result 282 states and 327 transitions. [2018-02-04 15:06:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 15:06:31,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 267 [2018-02-04 15:06:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:31,128 INFO L225 Difference]: With dead ends: 282 [2018-02-04 15:06:31,128 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 15:06:31,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1070, Invalid=3760, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:06:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 15:06:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2018-02-04 15:06:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-04 15:06:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2018-02-04 15:06:31,130 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 267 [2018-02-04 15:06:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:31,130 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2018-02-04 15:06:31,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 15:06:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2018-02-04 15:06:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 15:06:31,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:31,131 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 41, 41, 41, 41, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:31,131 INFO L371 AbstractCegarLoop]: === Iteration 51 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1628702311, now seen corresponding path program 41 times [2018-02-04 15:06:31,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:31,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 1223 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:31,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 15:06:31,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,741 INFO L182 omatonBuilderFactory]: Interpolants [18560#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 18561#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 18562#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 18563#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 18564#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 18565#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 18566#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 18567#(<= SelectionSort_~array_size SelectionSort_~j~0), 18521#true, 18522#false, 18523#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 18524#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 18525#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 18526#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 18527#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 18528#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 18529#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 18530#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 18531#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 18532#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 18533#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 18534#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 18535#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 18536#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 18537#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 18538#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 18539#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 18540#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 18541#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 18542#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 18543#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 18544#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 18545#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 22)), 18546#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 21)), 18547#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 18548#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 18549#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 18550#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 18551#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 18552#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 18553#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 18554#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 18555#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 18556#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 18557#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 18558#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 18559#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8))] [2018-02-04 15:06:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 1223 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 15:06:31,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 15:06:31,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 15:06:31,742 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand 47 states. [2018-02-04 15:06:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:32,373 INFO L93 Difference]: Finished difference Result 432 states and 502 transitions. [2018-02-04 15:06:32,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 15:06:32,373 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 273 [2018-02-04 15:06:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:32,374 INFO L225 Difference]: With dead ends: 432 [2018-02-04 15:06:32,374 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 15:06:32,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1126, Invalid=3566, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 15:06:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 15:06:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-04 15:06:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 15:06:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 339 transitions. [2018-02-04 15:06:32,377 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 339 transitions. Word has length 273 [2018-02-04 15:06:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:32,377 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 339 transitions. [2018-02-04 15:06:32,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 15:06:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 339 transitions. [2018-02-04 15:06:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-04 15:06:32,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:32,379 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 42, 42, 42, 42, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:32,379 INFO L371 AbstractCegarLoop]: === Iteration 52 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2091171077, now seen corresponding path program 42 times [2018-02-04 15:06:32,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:32,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 1325 proven. 4055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:33,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:33,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 15:06:33,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:33,120 INFO L182 omatonBuilderFactory]: Interpolants [19336#true, 19337#false, 19338#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 19339#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 19340#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 19341#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 19342#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 19343#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 19344#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 19345#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 19346#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 19347#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 19348#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 19349#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 19350#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 19351#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 19352#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 19353#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 19354#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 19355#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 19356#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 19357#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 19358#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 19359#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 19360#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 92) (select |#length| SelectionSort_~a.base)), 19361#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 88) (select |#length| SelectionSort_~a.base)), 19362#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 19363#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 19364#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 19365#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 19366#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 19367#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 19368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 19369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 19370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 19371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 19372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 19373#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 19374#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 19375#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 19376#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 19377#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 19378#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 19379#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 19380#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 19381#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 19382#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 19383#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 1325 proven. 4055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:33,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 15:06:33,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 15:06:33,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=1740, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:06:33,121 INFO L87 Difference]: Start difference. First operand 291 states and 339 transitions. Second operand 48 states. [2018-02-04 15:06:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:34,792 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2018-02-04 15:06:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 15:06:34,792 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 279 [2018-02-04 15:06:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:34,793 INFO L225 Difference]: With dead ends: 294 [2018-02-04 15:06:34,793 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 15:06:34,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1164, Invalid=4092, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:06:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 15:06:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-02-04 15:06:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 15:06:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-02-04 15:06:34,795 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 279 [2018-02-04 15:06:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:34,796 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-02-04 15:06:34,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 15:06:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-02-04 15:06:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-04 15:06:34,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:34,797 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 43, 43, 43, 43, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:34,797 INFO L371 AbstractCegarLoop]: === Iteration 53 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 884073049, now seen corresponding path program 43 times [2018-02-04 15:06:34,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:34,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5637 backedges. 1347 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:35,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 15:06:35,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,536 INFO L182 omatonBuilderFactory]: Interpolants [20020#true, 20021#false, 20022#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 20023#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 20024#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 20025#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 20026#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 20027#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 20028#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 20029#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 20030#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 20031#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 20032#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 20033#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 20034#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 20035#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 20036#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 20037#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 20038#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 20039#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 20040#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 20041#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 20042#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 20043#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 20044#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 20045#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 23)), 20046#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 22)), 20047#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 20048#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 20049#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 20050#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 20051#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 20052#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 20053#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 20054#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 20055#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 20056#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 20057#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 20058#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 20059#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 20060#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 20061#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 20062#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 20063#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 20064#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 20065#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 20066#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 20067#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 20068#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5637 backedges. 1347 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 15:06:35,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 15:06:35,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:06:35,537 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 49 states. [2018-02-04 15:06:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:36,049 INFO L93 Difference]: Finished difference Result 450 states and 523 transitions. [2018-02-04 15:06:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 15:06:36,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 285 [2018-02-04 15:06:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:36,050 INFO L225 Difference]: With dead ends: 450 [2018-02-04 15:06:36,050 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 15:06:36,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1223, Invalid=3889, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 15:06:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 15:06:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2018-02-04 15:06:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 15:06:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 353 transitions. [2018-02-04 15:06:36,052 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 353 transitions. Word has length 285 [2018-02-04 15:06:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:36,052 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 353 transitions. [2018-02-04 15:06:36,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 15:06:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 353 transitions. [2018-02-04 15:06:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-02-04 15:06:36,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:36,053 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 44, 44, 44, 44, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:36,053 INFO L371 AbstractCegarLoop]: === Iteration 54 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1415257147, now seen corresponding path program 44 times [2018-02-04 15:06:36,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:36,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5900 backedges. 1454 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:36,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:36,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 15:06:36,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:36,861 INFO L182 omatonBuilderFactory]: Interpolants [20869#true, 20870#false, 20871#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 20872#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 20873#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 20874#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 20875#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 20876#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 20877#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 20878#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 20879#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 20880#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 20881#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 20882#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 20883#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 20884#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 20885#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 20886#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 20887#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 20888#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 20889#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 20890#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 20891#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 20892#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 20893#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 20894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 96) (select |#length| SelectionSort_~a.base)), 20895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 92) (select |#length| SelectionSort_~a.base)), 20896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 20897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 20898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 20899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 20900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 20901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 20902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 20903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 20904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 20905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 20906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 20907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 20908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 20909#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 20910#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 20911#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 20912#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 20913#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 20914#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 20915#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 20916#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 20917#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 20918#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5900 backedges. 1454 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:36,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 15:06:36,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 15:06:36,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=1888, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:06:36,862 INFO L87 Difference]: Start difference. First operand 303 states and 353 transitions. Second operand 50 states. [2018-02-04 15:06:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:38,702 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-04 15:06:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 15:06:38,703 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2018-02-04 15:06:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:38,703 INFO L225 Difference]: With dead ends: 306 [2018-02-04 15:06:38,703 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 15:06:38,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1262, Invalid=4438, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:06:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 15:06:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2018-02-04 15:06:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 15:06:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2018-02-04 15:06:38,705 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 291 [2018-02-04 15:06:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:38,705 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2018-02-04 15:06:38,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 15:06:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2018-02-04 15:06:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 15:06:38,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:38,706 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 45, 45, 45, 45, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:38,706 INFO L371 AbstractCegarLoop]: === Iteration 55 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash -47580903, now seen corresponding path program 45 times [2018-02-04 15:06:38,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:38,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 1477 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:39,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:39,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 15:06:39,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:39,525 INFO L182 omatonBuilderFactory]: Interpolants [21581#true, 21582#false, 21583#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 21584#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 21585#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 21586#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 21587#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 21588#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 21589#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 21590#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 21591#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 21592#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 21593#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 21594#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 21595#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 21596#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 21597#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 21598#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 21599#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 21600#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 21601#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 21602#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 21603#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 21604#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 21605#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 21606#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 21607#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 24)), 21608#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 23)), 21609#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 21610#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 21611#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 21612#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 21613#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 21614#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 21615#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 21616#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 21617#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 21618#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 21619#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 21620#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 21621#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 21622#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 21623#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 21624#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 21625#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 21626#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 21627#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 21628#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 21629#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 21630#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 21631#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 1477 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:39,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 15:06:39,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 15:06:39,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1921, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:06:39,526 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand 51 states. [2018-02-04 15:06:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:40,172 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-02-04 15:06:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 15:06:40,172 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 297 [2018-02-04 15:06:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:40,173 INFO L225 Difference]: With dead ends: 468 [2018-02-04 15:06:40,173 INFO L226 Difference]: Without dead ends: 325 [2018-02-04 15:06:40,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1324, Invalid=4226, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 15:06:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-04 15:06:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2018-02-04 15:06:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 15:06:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 367 transitions. [2018-02-04 15:06:40,175 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 367 transitions. Word has length 297 [2018-02-04 15:06:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:40,175 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 367 transitions. [2018-02-04 15:06:40,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 15:06:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 367 transitions. [2018-02-04 15:06:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-04 15:06:40,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:40,176 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 46, 46, 46, 46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:40,176 INFO L371 AbstractCegarLoop]: === Iteration 56 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1041614715, now seen corresponding path program 46 times [2018-02-04 15:06:40,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:40,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 1589 proven. 4855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:41,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:41,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 15:06:41,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:41,068 INFO L182 omatonBuilderFactory]: Interpolants [22464#true, 22465#false, 22466#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 22467#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 22468#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 22469#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 22470#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 22471#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 22472#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 22473#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 22474#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 22475#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 22476#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 22477#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 22478#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 22479#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 22480#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 22481#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 22482#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 22483#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 22484#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 22485#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 22486#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 22487#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 22488#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 22489#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 22490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 100) (select |#length| SelectionSort_~a.base)), 22491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 96) (select |#length| SelectionSort_~a.base)), 22492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 22493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 22494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 22495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 22496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 22497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 22498#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 22499#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 22500#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 22501#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 22502#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 22503#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 22504#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 22505#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 22506#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 22507#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 22508#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 22509#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 22510#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 22511#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 22512#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 22513#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 22514#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 22515#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 1589 proven. 4855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:41,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 15:06:41,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 15:06:41,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=2042, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:06:41,068 INFO L87 Difference]: Start difference. First operand 315 states and 367 transitions. Second operand 52 states. [2018-02-04 15:06:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:43,135 INFO L93 Difference]: Finished difference Result 318 states and 369 transitions. [2018-02-04 15:06:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 15:06:43,135 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 303 [2018-02-04 15:06:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:43,136 INFO L225 Difference]: With dead ends: 318 [2018-02-04 15:06:43,136 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 15:06:43,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1364, Invalid=4798, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 15:06:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 15:06:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2018-02-04 15:06:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 15:06:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 366 transitions. [2018-02-04 15:06:43,138 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 366 transitions. Word has length 303 [2018-02-04 15:06:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:43,138 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 366 transitions. [2018-02-04 15:06:43,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 15:06:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 366 transitions. [2018-02-04 15:06:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-02-04 15:06:43,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:43,139 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 47, 47, 47, 47, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:43,139 INFO L371 AbstractCegarLoop]: === Iteration 57 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1009992231, now seen corresponding path program 47 times [2018-02-04 15:06:43,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:43,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 1613 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:43,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 15:06:43,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,967 INFO L182 omatonBuilderFactory]: Interpolants [23204#true, 23205#false, 23206#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 23207#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 23208#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 23209#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 23210#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 23211#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 23212#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 23213#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 23214#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 23215#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 23216#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 23217#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 23218#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 23219#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 23220#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 23221#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 23222#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 23223#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 23224#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 23225#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 23226#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 23227#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 23228#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 23229#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 23230#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 23231#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 25)), 23232#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 24)), 23233#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 23234#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 23235#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 23236#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 23237#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 23238#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 23239#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 23240#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 23241#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 23242#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 23243#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 23244#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 23245#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 23246#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 23247#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 23248#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 23249#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 23250#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 23251#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 23252#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 23253#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 23254#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 23255#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 23256#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 1613 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 15:06:43,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 15:06:43,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=2076, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 15:06:43,968 INFO L87 Difference]: Start difference. First operand 315 states and 366 transitions. Second operand 53 states. [2018-02-04 15:06:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:44,639 INFO L93 Difference]: Finished difference Result 486 states and 565 transitions. [2018-02-04 15:06:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 15:06:44,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 309 [2018-02-04 15:06:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:44,640 INFO L225 Difference]: With dead ends: 486 [2018-02-04 15:06:44,640 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 15:06:44,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1429, Invalid=4577, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 15:06:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 15:06:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 327. [2018-02-04 15:06:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 15:06:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 381 transitions. [2018-02-04 15:06:44,642 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 381 transitions. Word has length 309 [2018-02-04 15:06:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:44,643 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 381 transitions. [2018-02-04 15:06:44,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 15:06:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 381 transitions. [2018-02-04 15:06:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-02-04 15:06:44,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:44,644 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 48, 48, 48, 48, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:44,644 INFO L371 AbstractCegarLoop]: === Iteration 58 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1181563717, now seen corresponding path program 48 times [2018-02-04 15:06:44,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:44,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7012 backedges. 1730 proven. 5282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:45,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:45,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 15:06:45,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:45,642 INFO L182 omatonBuilderFactory]: Interpolants [24121#true, 24122#false, 24123#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 24124#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 24125#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 24126#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 24127#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 24128#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 24129#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 24130#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 24131#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 24132#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 24133#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 24134#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 24135#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 24136#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 24137#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 24138#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 24139#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 24140#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 24141#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 24142#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 24143#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 24144#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 24145#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 24146#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 24147#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 24148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 104) (select |#length| SelectionSort_~a.base)), 24149#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 100) (select |#length| SelectionSort_~a.base)), 24150#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 24151#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 24152#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 24153#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 24154#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 24155#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 24156#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 24157#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 24158#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 24159#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 24160#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 24161#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 24162#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 24163#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 24164#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 24165#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 24166#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 24167#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 24168#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 24169#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 24170#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 24171#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 24172#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 24173#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 24174#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:06:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7012 backedges. 1730 proven. 5282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:45,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 15:06:45,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 15:06:45,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:06:45,642 INFO L87 Difference]: Start difference. First operand 327 states and 381 transitions. Second operand 54 states. [2018-02-04 15:06:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:47,817 INFO L93 Difference]: Finished difference Result 330 states and 383 transitions. [2018-02-04 15:06:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 15:06:47,817 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2018-02-04 15:06:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:47,818 INFO L225 Difference]: With dead ends: 330 [2018-02-04 15:06:47,818 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 15:06:47,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1470, Invalid=5172, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 15:06:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 15:06:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2018-02-04 15:06:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 15:06:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 380 transitions. [2018-02-04 15:06:47,820 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 380 transitions. Word has length 315 [2018-02-04 15:06:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:47,820 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 380 transitions. [2018-02-04 15:06:47,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 15:06:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 380 transitions. [2018-02-04 15:06:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-04 15:06:47,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:47,821 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 49, 49, 49, 49, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:47,822 INFO L371 AbstractCegarLoop]: === Iteration 59 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash 322089113, now seen corresponding path program 49 times [2018-02-04 15:06:47,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:47,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 1755 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:48,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 15:06:48,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,708 INFO L182 omatonBuilderFactory]: Interpolants [24889#true, 24890#false, 24891#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 24892#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 24893#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 24894#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 24895#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 24896#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 24897#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 24898#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 24899#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 24900#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 24901#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 24902#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 24903#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 24904#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 24905#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 24906#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 24907#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 24908#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 24909#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 24910#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 24911#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 24912#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 24913#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 24914#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 24915#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 24916#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 24917#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 26)), 24918#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 25)), 24919#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 24920#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 24921#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 24922#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 24923#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 24924#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 24925#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 24926#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 24927#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 24928#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 24929#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 24930#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 24931#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 24932#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 24933#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 24934#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 24935#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 24936#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 24937#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 24938#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 24939#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 24940#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 24941#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 24942#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 24943#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 1755 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 15:06:48,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 15:06:48,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=2237, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:06:48,709 INFO L87 Difference]: Start difference. First operand 327 states and 380 transitions. Second operand 55 states. [2018-02-04 15:06:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:49,429 INFO L93 Difference]: Finished difference Result 504 states and 586 transitions. [2018-02-04 15:06:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 15:06:49,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 321 [2018-02-04 15:06:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:49,430 INFO L225 Difference]: With dead ends: 504 [2018-02-04 15:06:49,430 INFO L226 Difference]: Without dead ends: 349 [2018-02-04 15:06:49,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1538, Invalid=4942, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 15:06:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-04 15:06:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2018-02-04 15:06:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 15:06:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 395 transitions. [2018-02-04 15:06:49,432 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 395 transitions. Word has length 321 [2018-02-04 15:06:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:49,432 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 395 transitions. [2018-02-04 15:06:49,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 15:06:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 395 transitions. [2018-02-04 15:06:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 15:06:49,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:49,433 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 50, 50, 50, 50, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:49,433 INFO L371 AbstractCegarLoop]: === Iteration 60 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1061579781, now seen corresponding path program 50 times [2018-02-04 15:06:49,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:49,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7604 backedges. 1877 proven. 5727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:50,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:50,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 15:06:50,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:50,531 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 25857#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 25858#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 25859#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 25860#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 25861#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 25862#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 25863#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 25864#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 25865#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 25866#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 25867#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 25868#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 108) (select |#length| SelectionSort_~a.base)), 25869#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 104) (select |#length| SelectionSort_~a.base)), 25870#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 25871#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 25872#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 25873#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 25874#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 25875#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 25876#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 25877#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 25878#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 25879#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 25880#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 25881#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 25882#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 25883#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 25884#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 25885#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 25886#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 25887#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 25888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 25889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 25890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 25891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 25892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 25893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 25894#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 25895#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 25840#true, 25841#false, 25842#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 25843#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 25844#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 25845#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 25846#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 25847#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 25848#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 25849#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 25850#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 25851#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 25852#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 25853#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 25854#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 25855#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0)] [2018-02-04 15:06:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7604 backedges. 1877 proven. 5727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:50,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 15:06:50,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 15:06:50,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:06:50,532 INFO L87 Difference]: Start difference. First operand 339 states and 395 transitions. Second operand 56 states. [2018-02-04 15:06:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:52,990 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-04 15:06:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 15:06:52,990 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2018-02-04 15:06:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:52,991 INFO L225 Difference]: With dead ends: 342 [2018-02-04 15:06:52,991 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 15:06:52,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1580, Invalid=5560, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:06:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 15:06:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 339. [2018-02-04 15:06:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-04 15:06:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 394 transitions. [2018-02-04 15:06:52,993 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 394 transitions. Word has length 327 [2018-02-04 15:06:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:52,993 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 394 transitions. [2018-02-04 15:06:52,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 15:06:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 394 transitions. [2018-02-04 15:06:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-04 15:06:52,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:52,994 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 51, 51, 51, 51, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:52,994 INFO L371 AbstractCegarLoop]: === Iteration 61 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash 487870809, now seen corresponding path program 51 times [2018-02-04 15:06:52,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:53,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7909 backedges. 1903 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:54,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:54,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 15:06:54,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:54,024 INFO L182 omatonBuilderFactory]: Interpolants [26636#true, 26637#false, 26638#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 26639#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 26640#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 26641#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 26642#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 26643#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 26644#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 26645#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 26646#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 26647#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 26648#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 26649#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 26650#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 26651#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 26652#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 26653#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 26654#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 26655#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 26656#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 26657#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 26658#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 26659#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 26660#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 26661#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 26662#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 26663#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 26664#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 26665#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 27)), 26666#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 26)), 26667#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 26668#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 26669#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 26670#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 26671#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 26672#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 26673#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 26674#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 26675#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 26676#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 26677#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 26678#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 26679#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 26680#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 26681#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 26682#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 26683#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 26684#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 26685#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 26686#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 26687#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 26688#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 26689#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 26690#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 26691#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 26692#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7909 backedges. 1903 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:54,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 15:06:54,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 15:06:54,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=788, Invalid=2404, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:06:54,024 INFO L87 Difference]: Start difference. First operand 339 states and 394 transitions. Second operand 57 states. [2018-02-04 15:06:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:54,786 INFO L93 Difference]: Finished difference Result 522 states and 607 transitions. [2018-02-04 15:06:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 15:06:54,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 333 [2018-02-04 15:06:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:54,787 INFO L225 Difference]: With dead ends: 522 [2018-02-04 15:06:54,787 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 15:06:54,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1651, Invalid=5321, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 15:06:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 15:06:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 351. [2018-02-04 15:06:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 15:06:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 409 transitions. [2018-02-04 15:06:54,789 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 409 transitions. Word has length 333 [2018-02-04 15:06:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:54,789 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 409 transitions. [2018-02-04 15:06:54,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 15:06:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 409 transitions. [2018-02-04 15:06:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-02-04 15:06:54,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:54,790 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 52, 52, 52, 52, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:54,790 INFO L371 AbstractCegarLoop]: === Iteration 62 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash 430852805, now seen corresponding path program 52 times [2018-02-04 15:06:54,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:54,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8220 backedges. 2030 proven. 6190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:55,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:55,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 15:06:55,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:55,873 INFO L182 omatonBuilderFactory]: Interpolants [27648#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 27649#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 27650#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 112) (select |#length| SelectionSort_~a.base)), 27651#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 108) (select |#length| SelectionSort_~a.base)), 27652#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 27653#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 27654#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 27655#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 27656#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 27657#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 27658#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 27659#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 27660#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 27661#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 27662#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 27663#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 27664#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 27665#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 27666#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 27667#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 27668#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 27669#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 27670#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 27671#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 27672#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 27673#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 27674#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 27675#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 27676#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 27677#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 27678#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 27621#true, 27622#false, 27623#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 27624#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 27625#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 27626#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 27627#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 27628#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 27629#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 27630#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 27631#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 27632#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 27633#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 27634#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 27635#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 27636#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 27637#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 27638#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 27639#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 27640#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 27641#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 27642#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 27643#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 27644#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 27645#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 27646#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 27647#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0)] [2018-02-04 15:06:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8220 backedges. 2030 proven. 6190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:55,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 15:06:55,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 15:06:55,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=2540, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:06:55,873 INFO L87 Difference]: Start difference. First operand 351 states and 409 transitions. Second operand 58 states. [2018-02-04 15:06:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:58,348 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2018-02-04 15:06:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 15:06:58,348 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 339 [2018-02-04 15:06:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:58,349 INFO L225 Difference]: With dead ends: 354 [2018-02-04 15:06:58,349 INFO L226 Difference]: Without dead ends: 354 [2018-02-04 15:06:58,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1694, Invalid=5962, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 15:06:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-04 15:06:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-02-04 15:06:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 15:06:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 408 transitions. [2018-02-04 15:06:58,351 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 408 transitions. Word has length 339 [2018-02-04 15:06:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:58,351 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 408 transitions. [2018-02-04 15:06:58,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 15:06:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 408 transitions. [2018-02-04 15:06:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-02-04 15:06:58,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:58,352 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 53, 53, 53, 53, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:06:58,353 INFO L371 AbstractCegarLoop]: === Iteration 63 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:06:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1572200423, now seen corresponding path program 53 times [2018-02-04 15:06:58,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:58,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8537 backedges. 2057 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:59,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:59,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 15:06:59,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:59,434 INFO L182 omatonBuilderFactory]: Interpolants [28445#true, 28446#false, 28447#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 28448#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 28449#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 28450#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 28451#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 28452#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 28453#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 28454#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 28455#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 28456#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 28457#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 28458#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 28459#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 28460#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 28461#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 28462#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 28463#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 28464#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 28465#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 28466#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 28467#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 28468#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 28469#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 28470#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 28471#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 28472#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 28473#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 28474#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 28475#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 28)), 28476#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 27)), 28477#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 28478#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 28479#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 28480#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 28481#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 28482#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 28483#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 28484#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 28485#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 28486#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 28487#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 28488#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 28489#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 28490#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 28491#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 28492#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 28493#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 28494#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 28495#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 28496#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 28497#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 28498#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 28499#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 28500#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 28501#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 28502#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 28503#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:06:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8537 backedges. 2057 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:59,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 15:06:59,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 15:06:59,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=2577, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 15:06:59,435 INFO L87 Difference]: Start difference. First operand 351 states and 408 transitions. Second operand 59 states. [2018-02-04 15:07:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:00,275 INFO L93 Difference]: Finished difference Result 540 states and 628 transitions. [2018-02-04 15:07:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 15:07:00,275 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 345 [2018-02-04 15:07:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:00,276 INFO L225 Difference]: With dead ends: 540 [2018-02-04 15:07:00,276 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 15:07:00,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1768, Invalid=5714, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 15:07:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 15:07:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 363. [2018-02-04 15:07:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 15:07:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 423 transitions. [2018-02-04 15:07:00,279 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 423 transitions. Word has length 345 [2018-02-04 15:07:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:00,279 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 423 transitions. [2018-02-04 15:07:00,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 15:07:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 423 transitions. [2018-02-04 15:07:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-02-04 15:07:00,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:00,280 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 54, 54, 54, 54, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:00,280 INFO L371 AbstractCegarLoop]: === Iteration 64 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1845667963, now seen corresponding path program 54 times [2018-02-04 15:07:00,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:00,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8860 backedges. 2189 proven. 6671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:01,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 15:07:01,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,488 INFO L182 omatonBuilderFactory]: Interpolants [29464#true, 29465#false, 29466#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 29467#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 29468#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 29469#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 29470#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 29471#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 29472#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 29473#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 29474#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 29475#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 29476#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 29477#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 29478#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 29479#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 29480#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 29481#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 29482#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 29483#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 29484#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 29485#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 29486#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 29487#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 29488#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 29489#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 29490#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 29491#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 29492#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 29493#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 29494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 116) (select |#length| SelectionSort_~a.base)), 29495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 112) (select |#length| SelectionSort_~a.base)), 29496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 29497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 29498#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 29499#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 29500#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 29501#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 29502#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 29503#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 29504#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 29505#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 29506#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 29507#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 29508#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 29509#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 29510#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 29511#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 29512#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 29513#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 29514#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 29515#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 29516#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 29517#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 29518#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 29519#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 29520#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 29521#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 29522#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 29523#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:07:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8860 backedges. 2189 proven. 6671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 15:07:01,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 15:07:01,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=2718, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:07:01,489 INFO L87 Difference]: Start difference. First operand 363 states and 423 transitions. Second operand 60 states. [2018-02-04 15:07:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:04,532 INFO L93 Difference]: Finished difference Result 366 states and 425 transitions. [2018-02-04 15:07:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 15:07:04,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 351 [2018-02-04 15:07:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:04,533 INFO L225 Difference]: With dead ends: 366 [2018-02-04 15:07:04,533 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 15:07:04,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1812, Invalid=6378, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 15:07:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 15:07:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2018-02-04 15:07:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 15:07:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 422 transitions. [2018-02-04 15:07:04,536 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 422 transitions. Word has length 351 [2018-02-04 15:07:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:04,536 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 422 transitions. [2018-02-04 15:07:04,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 15:07:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 422 transitions. [2018-02-04 15:07:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 15:07:04,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:04,537 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 55, 55, 55, 55, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:04,537 INFO L371 AbstractCegarLoop]: === Iteration 65 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:04,537 INFO L82 PathProgramCache]: Analyzing trace with hash -624124711, now seen corresponding path program 55 times [2018-02-04 15:07:04,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:04,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 2217 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:05,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:05,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 15:07:05,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:05,672 INFO L182 omatonBuilderFactory]: Interpolants [30336#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 30337#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 30338#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 30339#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 30340#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 30341#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 30342#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 30343#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 30344#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 30345#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 30346#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 30347#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 29)), 30348#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 28)), 30349#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 30350#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 30351#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 30352#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 30353#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 30354#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 30355#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 30356#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 30357#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 30358#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 30359#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 30360#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 30361#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 30362#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 30363#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 30364#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 30365#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 30366#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 30367#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 30368#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 30369#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 30370#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 30371#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 30372#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 30373#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 30374#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 30375#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 30376#(<= SelectionSort_~array_size SelectionSort_~j~0), 30316#true, 30317#false, 30318#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 30319#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 30320#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 30321#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 30322#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 30323#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 30324#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 30325#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 30326#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 30327#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 30328#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 30329#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 30330#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 30331#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 30332#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 30333#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 30334#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 30335#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18))] [2018-02-04 15:07:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 2217 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:05,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 15:07:05,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 15:07:05,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=2756, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:07:05,673 INFO L87 Difference]: Start difference. First operand 363 states and 422 transitions. Second operand 61 states. [2018-02-04 15:07:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:06,355 INFO L93 Difference]: Finished difference Result 558 states and 649 transitions. [2018-02-04 15:07:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 15:07:06,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 357 [2018-02-04 15:07:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:06,357 INFO L225 Difference]: With dead ends: 558 [2018-02-04 15:07:06,357 INFO L226 Difference]: Without dead ends: 385 [2018-02-04 15:07:06,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1889, Invalid=6121, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 15:07:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-04 15:07:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 375. [2018-02-04 15:07:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 15:07:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 437 transitions. [2018-02-04 15:07:06,359 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 437 transitions. Word has length 357 [2018-02-04 15:07:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:06,359 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 437 transitions. [2018-02-04 15:07:06,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 15:07:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2018-02-04 15:07:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-02-04 15:07:06,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:06,360 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 56, 56, 56, 56, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:06,360 INFO L371 AbstractCegarLoop]: === Iteration 66 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1683221947, now seen corresponding path program 56 times [2018-02-04 15:07:06,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:06,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 2354 proven. 7170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:07,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:07,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 15:07:07,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:07,761 INFO L182 omatonBuilderFactory]: Interpolants [31369#true, 31370#false, 31371#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 31372#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 31373#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 31374#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 31375#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 31376#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 31377#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 31378#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 31379#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 31380#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 31381#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 31382#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 31383#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 31384#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 31385#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 31386#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 31387#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 31388#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 31389#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 31390#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 31391#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 31392#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 31393#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 31394#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 31395#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 31396#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 31397#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 31398#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 31399#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 31400#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 120) (select |#length| SelectionSort_~a.base)), 31401#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 116) (select |#length| SelectionSort_~a.base)), 31402#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 31403#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 31404#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 31405#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 31406#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 31407#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 31408#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 31409#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 31410#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 31411#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 31412#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 31413#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 31414#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 31415#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 31416#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 31417#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 31418#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 31419#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 31420#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 31421#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 31422#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 31423#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 31424#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 31425#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 31426#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 31427#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 31428#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 31429#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 31430#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:07:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9524 backedges. 2354 proven. 7170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:07,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 15:07:07,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 15:07:07,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=2902, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:07:07,762 INFO L87 Difference]: Start difference. First operand 375 states and 437 transitions. Second operand 62 states. [2018-02-04 15:07:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:10,463 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-04 15:07:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 15:07:10,464 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 363 [2018-02-04 15:07:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:10,465 INFO L225 Difference]: With dead ends: 378 [2018-02-04 15:07:10,465 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 15:07:10,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1934, Invalid=6808, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 15:07:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 15:07:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2018-02-04 15:07:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-04 15:07:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 436 transitions. [2018-02-04 15:07:10,467 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 436 transitions. Word has length 363 [2018-02-04 15:07:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:10,467 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 436 transitions. [2018-02-04 15:07:10,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 15:07:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 436 transitions. [2018-02-04 15:07:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-02-04 15:07:10,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:10,469 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 57, 57, 57, 57, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:10,469 INFO L371 AbstractCegarLoop]: === Iteration 67 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:10,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1572095897, now seen corresponding path program 57 times [2018-02-04 15:07:10,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:10,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9865 backedges. 2383 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:11,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 15:07:11,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,683 INFO L182 omatonBuilderFactory]: Interpolants [32256#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 32257#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 32258#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 32259#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 32260#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 32261#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 32262#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 32263#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 32264#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 32265#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 32266#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 32267#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 32268#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 32269#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 32270#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 32271#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 32272#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 32273#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 32274#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 32275#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 32276#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 32277#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 32278#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 32279#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 32280#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 32281#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 30)), 32282#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 29)), 32283#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 32284#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 32285#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 32286#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 32287#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 32288#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 32289#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 32290#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 32291#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 32292#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 32293#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 32294#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 32295#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 32296#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 32297#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 32298#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 32299#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 32300#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 32301#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 32302#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 32303#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 32304#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 32305#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 32306#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 32307#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 32308#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 32309#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 32310#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 32311#(<= SelectionSort_~array_size SelectionSort_~j~0), 32249#true, 32250#false, 32251#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 32252#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 32253#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 32254#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 32255#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-04 15:07:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9865 backedges. 2383 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 15:07:11,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 15:07:11,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2941, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:07:11,684 INFO L87 Difference]: Start difference. First operand 375 states and 436 transitions. Second operand 63 states. [2018-02-04 15:07:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:12,510 INFO L93 Difference]: Finished difference Result 576 states and 670 transitions. [2018-02-04 15:07:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 15:07:12,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 369 [2018-02-04 15:07:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:12,512 INFO L225 Difference]: With dead ends: 576 [2018-02-04 15:07:12,512 INFO L226 Difference]: Without dead ends: 397 [2018-02-04 15:07:12,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2014, Invalid=6542, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 15:07:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-04 15:07:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 387. [2018-02-04 15:07:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 15:07:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 451 transitions. [2018-02-04 15:07:12,514 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 451 transitions. Word has length 369 [2018-02-04 15:07:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:12,515 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 451 transitions. [2018-02-04 15:07:12,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 15:07:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 451 transitions. [2018-02-04 15:07:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-02-04 15:07:12,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:12,516 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 58, 58, 58, 58, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:12,516 INFO L371 AbstractCegarLoop]: === Iteration 68 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1230174981, now seen corresponding path program 58 times [2018-02-04 15:07:12,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:12,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10212 backedges. 2525 proven. 7687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:13,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:13,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 15:07:13,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:13,981 INFO L182 omatonBuilderFactory]: Interpolants [33336#true, 33337#false, 33338#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 33339#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 33340#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 33341#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 33342#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 33343#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 33344#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 33345#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 33346#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 33347#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 33348#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 33349#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 33350#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 33351#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 33352#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 33353#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 33354#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 33355#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 33356#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 33357#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 33358#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 33359#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 33360#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 33361#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 33362#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 33363#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 33364#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 33365#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 33366#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 33367#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 33368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 124) (select |#length| SelectionSort_~a.base)), 33369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 120) (select |#length| SelectionSort_~a.base)), 33370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 33371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 33372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 33373#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 33374#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 33375#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 33376#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 33377#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 33378#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 33379#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 33380#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 33381#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 33382#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 33383#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 33384#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 33385#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 33386#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 33387#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 33388#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 33389#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 33390#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 33391#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 33392#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 33393#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 33394#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 33395#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 33396#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 33397#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 33398#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 33399#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:07:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10212 backedges. 2525 proven. 7687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:13,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 15:07:13,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 15:07:13,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=940, Invalid=3092, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:07:13,982 INFO L87 Difference]: Start difference. First operand 387 states and 451 transitions. Second operand 64 states. [2018-02-04 15:07:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:16,864 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2018-02-04 15:07:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 15:07:16,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 375 [2018-02-04 15:07:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:16,865 INFO L225 Difference]: With dead ends: 390 [2018-02-04 15:07:16,865 INFO L226 Difference]: Without dead ends: 390 [2018-02-04 15:07:16,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2060, Invalid=7252, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 15:07:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-04 15:07:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2018-02-04 15:07:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 15:07:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 450 transitions. [2018-02-04 15:07:16,867 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 450 transitions. Word has length 375 [2018-02-04 15:07:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:16,867 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 450 transitions. [2018-02-04 15:07:16,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 15:07:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 450 transitions. [2018-02-04 15:07:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-02-04 15:07:16,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:16,869 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 59, 59, 59, 59, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:16,869 INFO L371 AbstractCegarLoop]: === Iteration 69 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 154771545, now seen corresponding path program 59 times [2018-02-04 15:07:16,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:16,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10565 backedges. 2555 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:18,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:18,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 15:07:18,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:18,186 INFO L182 omatonBuilderFactory]: Interpolants [34304#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 34305#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 34306#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 34307#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 34308#(<= SelectionSort_~array_size SelectionSort_~j~0), 34244#true, 34245#false, 34246#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 34247#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 34248#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 34249#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 34250#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 34251#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 34252#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 34253#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 34254#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 34255#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 34256#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 34257#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 34258#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 34259#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 34260#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 34261#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 34262#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 34263#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 34264#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 34265#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 34266#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 34267#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 34268#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 34269#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 34270#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 34271#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 34272#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 34273#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 34274#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 34275#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 34276#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 34277#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 31)), 34278#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 30)), 34279#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 34280#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 34281#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 34282#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 34283#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 34284#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 34285#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 34286#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 34287#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 34288#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 34289#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 34290#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 34291#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 34292#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 34293#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 34294#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 34295#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 34296#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 34297#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 34298#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 34299#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 34300#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 34301#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 34302#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 34303#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-04 15:07:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10565 backedges. 2555 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:18,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 15:07:18,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 15:07:18,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=3132, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 15:07:18,187 INFO L87 Difference]: Start difference. First operand 387 states and 450 transitions. Second operand 65 states. [2018-02-04 15:07:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:19,302 INFO L93 Difference]: Finished difference Result 594 states and 691 transitions. [2018-02-04 15:07:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 15:07:19,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 381 [2018-02-04 15:07:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:19,303 INFO L225 Difference]: With dead ends: 594 [2018-02-04 15:07:19,304 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 15:07:19,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2143, Invalid=6977, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 15:07:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 15:07:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 399. [2018-02-04 15:07:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 15:07:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 465 transitions. [2018-02-04 15:07:19,306 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 465 transitions. Word has length 381 [2018-02-04 15:07:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:19,306 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 465 transitions. [2018-02-04 15:07:19,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 15:07:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 465 transitions. [2018-02-04 15:07:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-02-04 15:07:19,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:19,308 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 60, 60, 60, 60, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:19,308 INFO L371 AbstractCegarLoop]: === Iteration 70 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1263889979, now seen corresponding path program 60 times [2018-02-04 15:07:19,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:19,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 2702 proven. 8222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:20,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:20,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 15:07:20,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:20,777 INFO L182 omatonBuilderFactory]: Interpolants [35365#true, 35366#false, 35367#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 35368#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 35369#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 35370#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 35371#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 35372#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 35373#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 35374#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 35375#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 35376#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 35377#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 35378#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 35379#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 35380#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 35381#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 35382#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 35383#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 35384#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 35385#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 35386#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 35387#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 35388#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 35389#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 35390#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 35391#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 35392#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 35393#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 35394#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 35395#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 35396#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 35397#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 35398#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 128) (select |#length| SelectionSort_~a.base)), 35399#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 124) (select |#length| SelectionSort_~a.base)), 35400#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 35401#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 35402#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 35403#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 35404#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 35405#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 35406#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 35407#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 35408#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 35409#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 35410#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 35411#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 35412#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 35413#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 35414#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 35415#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 35416#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 35417#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 35418#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 35419#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 35420#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 35421#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 35422#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 35423#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 35424#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 35425#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 35426#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 35427#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 35428#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 35429#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 35430#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:07:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10924 backedges. 2702 proven. 8222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:20,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 15:07:20,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 15:07:20,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=3288, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 15:07:20,778 INFO L87 Difference]: Start difference. First operand 399 states and 465 transitions. Second operand 66 states. [2018-02-04 15:07:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:24,099 INFO L93 Difference]: Finished difference Result 402 states and 467 transitions. [2018-02-04 15:07:24,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 15:07:24,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 387 [2018-02-04 15:07:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:24,101 INFO L225 Difference]: With dead ends: 402 [2018-02-04 15:07:24,101 INFO L226 Difference]: Without dead ends: 402 [2018-02-04 15:07:24,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2190, Invalid=7710, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 15:07:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-04 15:07:24,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2018-02-04 15:07:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 15:07:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 464 transitions. [2018-02-04 15:07:24,104 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 464 transitions. Word has length 387 [2018-02-04 15:07:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:24,104 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 464 transitions. [2018-02-04 15:07:24,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 15:07:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 464 transitions. [2018-02-04 15:07:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-02-04 15:07:24,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:24,105 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 61, 61, 61, 61, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:24,105 INFO L371 AbstractCegarLoop]: === Iteration 71 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash -357226727, now seen corresponding path program 61 times [2018-02-04 15:07:24,106 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:24,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 2733 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:25,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:25,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 15:07:25,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:25,501 INFO L182 omatonBuilderFactory]: Interpolants [36352#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 36353#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 36354#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 36355#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 36356#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 36357#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 36358#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 36359#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 36360#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 36361#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 36362#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 36363#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 36364#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 36365#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 36366#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 36367#(<= SelectionSort_~array_size SelectionSort_~j~0), 36301#true, 36302#false, 36303#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 36304#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 36305#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 36306#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 36307#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 36308#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 36309#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 36310#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 36311#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 36312#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 36313#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 36314#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 36315#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 36316#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 36317#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 36318#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 36319#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 36320#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 36321#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 36322#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 36323#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 36324#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 36325#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 36326#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 36327#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 36328#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 36329#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 36330#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 36331#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 36332#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 36333#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 36334#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 36335#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 32)), 36336#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 31)), 36337#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 36338#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 36339#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 36340#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 36341#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 36342#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 36343#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 36344#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 36345#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 36346#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 36347#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 36348#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 36349#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 36350#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 36351#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16))] [2018-02-04 15:07:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 2733 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:25,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 15:07:25,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 15:07:25,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1093, Invalid=3329, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:07:25,502 INFO L87 Difference]: Start difference. First operand 399 states and 464 transitions. Second operand 67 states. [2018-02-04 15:07:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:26,682 INFO L93 Difference]: Finished difference Result 612 states and 712 transitions. [2018-02-04 15:07:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 15:07:26,683 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 393 [2018-02-04 15:07:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:26,684 INFO L225 Difference]: With dead ends: 612 [2018-02-04 15:07:26,684 INFO L226 Difference]: Without dead ends: 421 [2018-02-04 15:07:26,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2276, Invalid=7426, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 15:07:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-02-04 15:07:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2018-02-04 15:07:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 15:07:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 479 transitions. [2018-02-04 15:07:26,687 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 479 transitions. Word has length 393 [2018-02-04 15:07:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:26,687 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 479 transitions. [2018-02-04 15:07:26,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 15:07:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 479 transitions. [2018-02-04 15:07:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-02-04 15:07:26,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:26,688 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 62, 62, 62, 62, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:26,688 INFO L371 AbstractCegarLoop]: === Iteration 72 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash -427075963, now seen corresponding path program 62 times [2018-02-04 15:07:26,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:26,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 2885 proven. 8775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:28,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:28,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 15:07:28,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:28,368 INFO L182 omatonBuilderFactory]: Interpolants [37504#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 37505#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 37506#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 37507#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 37508#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 37509#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 37510#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 37511#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 37512#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 37513#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 37514#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 37515#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 37516#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 37517#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 37518#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 37519#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 37520#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 37521#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 37522#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 37523#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 37456#true, 37457#false, 37458#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 37459#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 37460#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 37461#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 37462#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 37463#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 37464#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 37465#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 37466#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 37467#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 37468#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 37469#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 37470#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 37471#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 37472#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 37473#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 37474#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 37475#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 37476#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 37477#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 37478#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 37479#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 37480#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 37481#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 37482#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 37483#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 37484#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 37485#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 37486#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 37487#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 37488#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 37489#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 37490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 132) (select |#length| SelectionSort_~a.base)), 37491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 128) (select |#length| SelectionSort_~a.base)), 37492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 37493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 37494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 37495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 37496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 37497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 37498#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 37499#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 37500#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 37501#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 37502#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 37503#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:07:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 2885 proven. 8775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:28,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 15:07:28,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 15:07:28,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1066, Invalid=3490, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 15:07:28,369 INFO L87 Difference]: Start difference. First operand 411 states and 479 transitions. Second operand 68 states. [2018-02-04 15:07:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:30,943 INFO L93 Difference]: Finished difference Result 414 states and 481 transitions. [2018-02-04 15:07:30,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 15:07:30,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 399 [2018-02-04 15:07:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:30,944 INFO L225 Difference]: With dead ends: 414 [2018-02-04 15:07:30,944 INFO L226 Difference]: Without dead ends: 414 [2018-02-04 15:07:30,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2324, Invalid=8182, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 15:07:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-02-04 15:07:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-02-04 15:07:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 15:07:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 478 transitions. [2018-02-04 15:07:30,947 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 478 transitions. Word has length 399 [2018-02-04 15:07:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:30,947 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 478 transitions. [2018-02-04 15:07:30,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 15:07:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 478 transitions. [2018-02-04 15:07:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-02-04 15:07:30,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:30,949 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 63, 63, 63, 63, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:30,949 INFO L371 AbstractCegarLoop]: === Iteration 73 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash 647977945, now seen corresponding path program 63 times [2018-02-04 15:07:30,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:31,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12037 backedges. 2917 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:32,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:32,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 15:07:32,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:32,437 INFO L182 omatonBuilderFactory]: Interpolants [38420#true, 38421#false, 38422#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 38423#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 38424#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 38425#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 38426#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 38427#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 38428#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 38429#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 38430#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 38431#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 38432#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 38433#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 38434#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 38435#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 38436#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 38437#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 38438#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 38439#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 38440#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 38441#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 38442#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 38443#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 38444#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 38445#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 38446#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 38447#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 38448#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 38449#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 38450#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 38451#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 38452#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 38453#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 38454#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 38455#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 33)), 38456#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 32)), 38457#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 38458#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 38459#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 38460#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 38461#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 38462#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 38463#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 38464#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 38465#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 38466#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 38467#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 38468#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 38469#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 38470#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 38471#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 38472#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 38473#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 38474#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 38475#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 38476#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 38477#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 38478#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 38479#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 38480#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 38481#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 38482#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 38483#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 38484#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 38485#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 38486#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 38487#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 38488#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:07:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12037 backedges. 2917 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:32,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 15:07:32,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 15:07:32,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=3532, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 15:07:32,438 INFO L87 Difference]: Start difference. First operand 411 states and 478 transitions. Second operand 69 states. [2018-02-04 15:07:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:33,676 INFO L93 Difference]: Finished difference Result 630 states and 733 transitions. [2018-02-04 15:07:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 15:07:33,676 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 405 [2018-02-04 15:07:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:33,678 INFO L225 Difference]: With dead ends: 630 [2018-02-04 15:07:33,678 INFO L226 Difference]: Without dead ends: 433 [2018-02-04 15:07:33,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2413, Invalid=7889, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 15:07:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-04 15:07:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2018-02-04 15:07:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 15:07:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 493 transitions. [2018-02-04 15:07:33,681 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 493 transitions. Word has length 405 [2018-02-04 15:07:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:33,681 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 493 transitions. [2018-02-04 15:07:33,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 15:07:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 493 transitions. [2018-02-04 15:07:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-02-04 15:07:33,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:33,682 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 64, 64, 64, 64, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:33,682 INFO L371 AbstractCegarLoop]: === Iteration 74 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:33,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1091712699, now seen corresponding path program 64 times [2018-02-04 15:07:33,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:33,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12420 backedges. 3074 proven. 9346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:35,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:35,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 15:07:35,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:35,384 INFO L182 omatonBuilderFactory]: Interpolants [39609#true, 39610#false, 39611#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 39612#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 39613#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 39614#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 39615#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 39616#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 39617#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 39618#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 39619#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 39620#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 39621#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 39622#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 39623#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 39624#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 39625#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 39626#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 39627#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 39628#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 39629#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 39630#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 39631#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 39632#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 39633#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 39634#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 39635#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 39636#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 39637#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 39638#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 39639#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 39640#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 39641#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 39642#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 39643#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 39644#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 136) (select |#length| SelectionSort_~a.base)), 39645#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 132) (select |#length| SelectionSort_~a.base)), 39646#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 39647#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 39648#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 39649#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 39650#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 39651#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 39652#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 39653#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 39654#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 39655#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 39656#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 39657#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 39658#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 39659#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 39660#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 39661#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 39662#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 39663#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 39664#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 39665#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 39666#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 39667#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 39668#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 39669#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 39670#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 39671#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 39672#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 39673#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 39674#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 39675#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 39676#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 39677#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 39678#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-04 15:07:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12420 backedges. 3074 proven. 9346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:35,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 15:07:35,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 15:07:35,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=3698, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:07:35,385 INFO L87 Difference]: Start difference. First operand 423 states and 493 transitions. Second operand 70 states. [2018-02-04 15:07:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,097 INFO L93 Difference]: Finished difference Result 426 states and 495 transitions. [2018-02-04 15:07:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 15:07:39,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 411 [2018-02-04 15:07:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,098 INFO L225 Difference]: With dead ends: 426 [2018-02-04 15:07:39,098 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 15:07:39,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2462, Invalid=8668, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 15:07:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 15:07:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 423. [2018-02-04 15:07:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 15:07:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 492 transitions. [2018-02-04 15:07:39,101 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 492 transitions. Word has length 411 [2018-02-04 15:07:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,101 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 492 transitions. [2018-02-04 15:07:39,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 15:07:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 492 transitions. [2018-02-04 15:07:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-02-04 15:07:39,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,102 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 65, 65, 65, 65, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:39,102 INFO L371 AbstractCegarLoop]: === Iteration 75 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -527384935, now seen corresponding path program 65 times [2018-02-04 15:07:39,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 3107 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:40,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 15:07:40,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,671 INFO L182 omatonBuilderFactory]: Interpolants [40601#true, 40602#false, 40603#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 40604#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 40605#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 40606#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 40607#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 40608#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 40609#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 40610#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 40611#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 40612#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 40613#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 40614#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 40615#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 40616#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 40617#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 40618#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 40619#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 40620#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 40621#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 40622#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 40623#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 40624#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 40625#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 40626#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 40627#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 40628#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 40629#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 40630#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 40631#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 40632#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 40633#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 40634#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 40635#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 40636#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 40637#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 34)), 40638#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 33)), 40639#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 40640#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 40641#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 40642#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 40643#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 40644#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 40645#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 40646#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 40647#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 40648#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 40649#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 40650#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 40651#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 40652#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 40653#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 40654#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 40655#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 40656#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 40657#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 40658#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 40659#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 40660#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 40661#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 40662#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 40663#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 40664#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 40665#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 40666#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 40667#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 40668#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 40669#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 40670#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 40671#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:07:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 3107 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 15:07:40,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 15:07:40,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=3741, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 15:07:40,672 INFO L87 Difference]: Start difference. First operand 423 states and 492 transitions. Second operand 71 states. [2018-02-04 15:07:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:41,867 INFO L93 Difference]: Finished difference Result 648 states and 754 transitions. [2018-02-04 15:07:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 15:07:41,868 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 417 [2018-02-04 15:07:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:41,869 INFO L225 Difference]: With dead ends: 648 [2018-02-04 15:07:41,869 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 15:07:41,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2554, Invalid=8366, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 15:07:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 15:07:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 435. [2018-02-04 15:07:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 15:07:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 507 transitions. [2018-02-04 15:07:41,871 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 507 transitions. Word has length 417 [2018-02-04 15:07:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:41,871 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 507 transitions. [2018-02-04 15:07:41,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 15:07:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 507 transitions. [2018-02-04 15:07:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-02-04 15:07:41,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:41,873 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 66, 66, 66, 66, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:41,873 INFO L371 AbstractCegarLoop]: === Iteration 76 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash -588617211, now seen corresponding path program 66 times [2018-02-04 15:07:41,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:41,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13204 backedges. 3269 proven. 9935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:43,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 15:07:43,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,720 INFO L182 omatonBuilderFactory]: Interpolants [41856#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 41857#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 41858#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 41859#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 41860#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 140) (select |#length| SelectionSort_~a.base)), 41861#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 136) (select |#length| SelectionSort_~a.base)), 41862#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 41863#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 41864#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 41865#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 41866#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 41867#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 41868#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 41869#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 41870#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 41871#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 41872#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 41873#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 41874#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 41875#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 41876#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 41877#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 41878#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 41879#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 41880#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 41881#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 41882#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 41883#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 41884#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 41885#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 41886#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 41887#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 41888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 41889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 41890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 41891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 41892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 41893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 41894#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 41895#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 41824#true, 41825#false, 41826#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 41827#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 41828#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 41829#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 41830#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 41831#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 41832#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 41833#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 41834#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 41835#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 41836#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 41837#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 41838#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 41839#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 41840#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 41841#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 41842#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 41843#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 41844#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 41845#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 41846#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 41847#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 41848#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 41849#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 41850#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 41851#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 41852#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 41853#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 41854#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 41855#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0)] [2018-02-04 15:07:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13204 backedges. 3269 proven. 9935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 15:07:43,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 15:07:43,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1200, Invalid=3912, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 15:07:43,721 INFO L87 Difference]: Start difference. First operand 435 states and 507 transitions. Second operand 72 states. [2018-02-04 15:07:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:47,887 INFO L93 Difference]: Finished difference Result 438 states and 509 transitions. [2018-02-04 15:07:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 15:07:47,888 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 423 [2018-02-04 15:07:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:47,888 INFO L225 Difference]: With dead ends: 438 [2018-02-04 15:07:47,888 INFO L226 Difference]: Without dead ends: 438 [2018-02-04 15:07:47,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2510 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2604, Invalid=9168, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 15:07:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-04 15:07:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2018-02-04 15:07:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 15:07:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 506 transitions. [2018-02-04 15:07:47,891 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 506 transitions. Word has length 423 [2018-02-04 15:07:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:47,891 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 506 transitions. [2018-02-04 15:07:47,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 15:07:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 506 transitions. [2018-02-04 15:07:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-02-04 15:07:47,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:47,892 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 67, 67, 67, 67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:47,892 INFO L371 AbstractCegarLoop]: === Iteration 77 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 591515481, now seen corresponding path program 67 times [2018-02-04 15:07:47,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:47,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13605 backedges. 3303 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:49,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:49,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 15:07:49,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:49,601 INFO L182 omatonBuilderFactory]: Interpolants [42880#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 42881#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 35)), 42882#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 34)), 42883#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 42884#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 42885#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 42886#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 42887#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 42888#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 42889#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 42890#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 42891#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 42892#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 42893#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 42894#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 42895#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 42896#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 42897#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 42898#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 42899#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 42900#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 42901#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 42902#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 42903#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 42904#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 42905#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 42906#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 42907#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 42908#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 42909#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 42910#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 42911#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 42912#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 42913#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 42914#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 42915#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 42916#(<= SelectionSort_~array_size SelectionSort_~j~0), 42844#true, 42845#false, 42846#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 42847#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 42848#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 42849#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 42850#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 42851#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 42852#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 42853#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 42854#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 42855#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 42856#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 42857#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 42858#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 42859#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 42860#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 42861#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 42862#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 42863#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 42864#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 42865#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 42866#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 42867#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 42868#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 42869#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 42870#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 42871#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 42872#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 42873#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 42874#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 42875#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 42876#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 42877#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 42878#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 42879#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34))] [2018-02-04 15:07:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13605 backedges. 3303 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:49,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 15:07:49,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 15:07:49,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1300, Invalid=3956, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:07:49,603 INFO L87 Difference]: Start difference. First operand 435 states and 506 transitions. Second operand 73 states. [2018-02-04 15:07:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:50,863 INFO L93 Difference]: Finished difference Result 666 states and 775 transitions. [2018-02-04 15:07:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 15:07:50,863 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 429 [2018-02-04 15:07:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:50,864 INFO L225 Difference]: With dead ends: 666 [2018-02-04 15:07:50,865 INFO L226 Difference]: Without dead ends: 457 [2018-02-04 15:07:50,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2699, Invalid=8857, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 15:07:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-04 15:07:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 447. [2018-02-04 15:07:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 15:07:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 521 transitions. [2018-02-04 15:07:50,867 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 521 transitions. Word has length 429 [2018-02-04 15:07:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:50,868 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 521 transitions. [2018-02-04 15:07:50,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 15:07:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 521 transitions. [2018-02-04 15:07:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-02-04 15:07:50,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:50,869 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 68, 68, 68, 68, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:50,869 INFO L371 AbstractCegarLoop]: === Iteration 78 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2034648891, now seen corresponding path program 68 times [2018-02-04 15:07:50,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:50,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14012 backedges. 3470 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:52,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:52,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 15:07:52,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:52,873 INFO L182 omatonBuilderFactory]: Interpolants [44160#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 44161#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 44162#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 44163#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 44164#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 44165#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 44166#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 44167#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 44168#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 44169#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 44170#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 44171#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 44172#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 44173#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 44174#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 44101#true, 44102#false, 44103#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 44104#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 44105#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 44106#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 44107#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 44108#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 44109#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 44110#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 44111#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 44112#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 44113#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 44114#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 44115#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 44116#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 44117#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 44118#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 44119#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 44120#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 44121#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 44122#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 44123#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 44124#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 44125#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 44126#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 44127#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 44128#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 44129#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 44130#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 44131#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 44132#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 44133#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 44134#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 44135#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 44136#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 44137#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 44138#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 144) (select |#length| SelectionSort_~a.base)), 44139#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 140) (select |#length| SelectionSort_~a.base)), 44140#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 44141#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 44142#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 44143#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 44144#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 44145#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 44146#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 44147#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 44148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 44149#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 44150#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 44151#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 44152#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 44153#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 44154#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 44155#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 44156#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 44157#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 44158#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 44159#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:07:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14012 backedges. 3470 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:52,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 15:07:52,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 15:07:52,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1270, Invalid=4132, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 15:07:52,874 INFO L87 Difference]: Start difference. First operand 447 states and 521 transitions. Second operand 74 states. [2018-02-04 15:07:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:55,459 INFO L93 Difference]: Finished difference Result 450 states and 523 transitions. [2018-02-04 15:07:55,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 15:07:55,459 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 435 [2018-02-04 15:07:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:55,460 INFO L225 Difference]: With dead ends: 450 [2018-02-04 15:07:55,460 INFO L226 Difference]: Without dead ends: 450 [2018-02-04 15:07:55,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2750, Invalid=9682, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 15:07:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-02-04 15:07:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2018-02-04 15:07:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 15:07:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 520 transitions. [2018-02-04 15:07:55,463 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 520 transitions. Word has length 435 [2018-02-04 15:07:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:55,464 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 520 transitions. [2018-02-04 15:07:55,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 15:07:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 520 transitions. [2018-02-04 15:07:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-04 15:07:55,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:55,465 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 69, 69, 69, 69, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:55,465 INFO L371 AbstractCegarLoop]: === Iteration 79 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -930410983, now seen corresponding path program 69 times [2018-02-04 15:07:55,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:55,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14425 backedges. 3505 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:57,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:57,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 15:07:57,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:57,208 INFO L182 omatonBuilderFactory]: Interpolants [45184#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 45185#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 45186#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 45187#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 36)), 45188#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 35)), 45189#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 45190#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 45191#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 45192#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 45193#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 45194#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 45195#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 45196#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 45197#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 45198#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 45199#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 45200#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 45201#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 45202#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 45203#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 45204#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 45205#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 45206#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 45207#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 45208#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 45209#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 45210#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 45211#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 45212#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 45213#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 45214#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 45215#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 45216#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 45217#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 45218#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 45219#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 45220#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 45221#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 45222#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 45223#(<= SelectionSort_~array_size SelectionSort_~j~0), 45149#true, 45150#false, 45151#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 45152#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 45153#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 45154#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 45155#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 45156#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 45157#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 45158#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 45159#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 45160#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 45161#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 45162#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 45163#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 45164#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 45165#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 45166#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 45167#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 45168#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 45169#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 45170#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 45171#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 45172#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 45173#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 45174#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 45175#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 45176#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 45177#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 45178#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 45179#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 45180#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 45181#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 45182#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 45183#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33))] [2018-02-04 15:07:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14425 backedges. 3505 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:57,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 15:07:57,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 15:07:57,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1373, Invalid=4177, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 15:07:57,209 INFO L87 Difference]: Start difference. First operand 447 states and 520 transitions. Second operand 75 states. [2018-02-04 15:07:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:58,606 INFO L93 Difference]: Finished difference Result 684 states and 796 transitions. [2018-02-04 15:07:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 15:07:58,607 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 441 [2018-02-04 15:07:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:58,608 INFO L225 Difference]: With dead ends: 684 [2018-02-04 15:07:58,608 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 15:07:58,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2848, Invalid=9362, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 15:07:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 15:07:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 459. [2018-02-04 15:07:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-02-04 15:07:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 535 transitions. [2018-02-04 15:07:58,611 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 535 transitions. Word has length 441 [2018-02-04 15:07:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:58,611 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 535 transitions. [2018-02-04 15:07:58,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 15:07:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 535 transitions. [2018-02-04 15:07:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-02-04 15:07:58,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:58,612 INFO L351 BasicCegarLoop]: trace histogram [72, 71, 70, 70, 70, 70, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:58,613 INFO L371 AbstractCegarLoop]: === Iteration 80 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1850460795, now seen corresponding path program 70 times [2018-02-04 15:07:58,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:58,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14844 backedges. 3677 proven. 11167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:00,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:00,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 15:08:00,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:00,544 INFO L182 omatonBuilderFactory]: Interpolants [46464#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 46465#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 46466#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 46467#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 46468#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 46469#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 46470#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 46471#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 46472#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 46473#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 46474#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 46475#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 46476#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 46477#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 46478#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 148) (select |#length| SelectionSort_~a.base)), 46479#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 144) (select |#length| SelectionSort_~a.base)), 46480#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 46481#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 46482#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 46483#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 46484#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 46485#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 46486#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 46487#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 46488#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 46489#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 46490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 46491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 46492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 46493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 46494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 46495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 46496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 46497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 46498#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 46499#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 46500#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 46501#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 46502#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 46503#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 46504#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 46505#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 46506#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 46507#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 46508#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 46509#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 46510#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 46511#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 46512#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 46513#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 46514#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 46515#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 46440#true, 46441#false, 46442#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 46443#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 46444#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 46445#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 46446#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 46447#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 46448#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 46449#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 46450#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 46451#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 46452#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 46453#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 46454#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 46455#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 46456#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 46457#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 46458#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 46459#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 46460#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 46461#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 46462#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 46463#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0)] [2018-02-04 15:08:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14844 backedges. 3677 proven. 11167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:00,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 15:08:00,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 15:08:00,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1342, Invalid=4358, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:08:00,545 INFO L87 Difference]: Start difference. First operand 459 states and 535 transitions. Second operand 76 states. [2018-02-04 15:08:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:05,532 INFO L93 Difference]: Finished difference Result 462 states and 537 transitions. [2018-02-04 15:08:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 15:08:05,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 447 [2018-02-04 15:08:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:05,534 INFO L225 Difference]: With dead ends: 462 [2018-02-04 15:08:05,534 INFO L226 Difference]: Without dead ends: 462 [2018-02-04 15:08:05,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2802 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2900, Invalid=10210, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 15:08:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-04 15:08:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2018-02-04 15:08:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-02-04 15:08:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 534 transitions. [2018-02-04 15:08:05,536 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 534 transitions. Word has length 447 [2018-02-04 15:08:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:05,537 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 534 transitions. [2018-02-04 15:08:05,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 15:08:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 534 transitions. [2018-02-04 15:08:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-02-04 15:08:05,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:05,538 INFO L351 BasicCegarLoop]: trace histogram [73, 72, 71, 71, 71, 71, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:05,538 INFO L371 AbstractCegarLoop]: === Iteration 81 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1634007769, now seen corresponding path program 71 times [2018-02-04 15:08:05,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:05,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15269 backedges. 3713 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:07,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:07,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 15:08:07,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:07,381 INFO L182 omatonBuilderFactory]: Interpolants [47516#true, 47517#false, 47518#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 47519#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 47520#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 47521#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 47522#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 47523#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 47524#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 47525#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 47526#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 47527#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 47528#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 47529#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 47530#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 47531#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 47532#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 47533#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 47534#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 47535#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 47536#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 47537#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 47538#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 47539#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 47540#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 47541#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 47542#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 47543#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 47544#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 47545#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 47546#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 47547#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 47548#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 47549#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 47550#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 47551#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 47552#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 47553#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 47554#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 47555#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 37)), 47556#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 36)), 47557#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 47558#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 47559#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 47560#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 47561#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 47562#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 47563#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 47564#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 47565#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 47566#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 47567#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 47568#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 47569#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 47570#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 47571#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 47572#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 47573#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 47574#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 47575#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 47576#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 47577#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 47578#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 47579#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 47580#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 47581#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 47582#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 47583#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 47584#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 47585#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 47586#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 47587#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 47588#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 47589#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 47590#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 47591#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 47592#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:08:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15269 backedges. 3713 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:07,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 15:08:07,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 15:08:07,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1448, Invalid=4404, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 15:08:07,382 INFO L87 Difference]: Start difference. First operand 459 states and 534 transitions. Second operand 77 states. [2018-02-04 15:08:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:08,872 INFO L93 Difference]: Finished difference Result 702 states and 817 transitions. [2018-02-04 15:08:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 15:08:08,873 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 453 [2018-02-04 15:08:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:08,874 INFO L225 Difference]: With dead ends: 702 [2018-02-04 15:08:08,874 INFO L226 Difference]: Without dead ends: 481 [2018-02-04 15:08:08,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3001, Invalid=9881, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 15:08:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-02-04 15:08:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 471. [2018-02-04 15:08:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 15:08:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 549 transitions. [2018-02-04 15:08:08,878 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 549 transitions. Word has length 453 [2018-02-04 15:08:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:08,878 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 549 transitions. [2018-02-04 15:08:08,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 15:08:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 549 transitions. [2018-02-04 15:08:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-02-04 15:08:08,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:08,879 INFO L351 BasicCegarLoop]: trace histogram [74, 73, 72, 72, 72, 72, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:08,879 INFO L371 AbstractCegarLoop]: === Iteration 82 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:08,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1246912581, now seen corresponding path program 72 times [2018-02-04 15:08:08,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:08,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 3890 proven. 11810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:10,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:10,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-02-04 15:08:10,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:10,982 INFO L182 omatonBuilderFactory]: Interpolants [48896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 48897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 48898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 48899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 48900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 48901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 48902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 48903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 48904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 48905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 48906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 48907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 48908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 48909#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 48910#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 48911#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 48912#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 48913#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 48914#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 48915#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 48916#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 48917#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 48918#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 48841#true, 48842#false, 48843#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 48844#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 48845#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 48846#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 48847#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 48848#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 48849#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 48850#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 48851#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 48852#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 48853#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 48854#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 48855#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 48856#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 48857#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 48858#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 48859#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 48860#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 48861#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 48862#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 48863#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 48864#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 48865#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 48866#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 48867#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 48868#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 48869#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 48870#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 48871#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 48872#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 48873#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 48874#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 48875#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 48876#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 48877#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 48878#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 48879#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 48880#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 152) (select |#length| SelectionSort_~a.base)), 48881#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 148) (select |#length| SelectionSort_~a.base)), 48882#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 48883#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 48884#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 48885#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 48886#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 48887#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 48888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 48889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 48890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 48891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 48892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 48893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 48894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 48895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:08:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 3890 proven. 11810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:10,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 15:08:10,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 15:08:10,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1416, Invalid=4590, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 15:08:10,983 INFO L87 Difference]: Start difference. First operand 471 states and 549 transitions. Second operand 78 states. [2018-02-04 15:08:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:14,211 INFO L93 Difference]: Finished difference Result 474 states and 551 transitions. [2018-02-04 15:08:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 15:08:14,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 459 [2018-02-04 15:08:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:14,212 INFO L225 Difference]: With dead ends: 474 [2018-02-04 15:08:14,212 INFO L226 Difference]: Without dead ends: 474 [2018-02-04 15:08:14,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2954 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3054, Invalid=10752, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 15:08:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-02-04 15:08:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2018-02-04 15:08:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 15:08:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 548 transitions. [2018-02-04 15:08:14,215 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 548 transitions. Word has length 459 [2018-02-04 15:08:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:14,215 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 548 transitions. [2018-02-04 15:08:14,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 15:08:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 548 transitions. [2018-02-04 15:08:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-02-04 15:08:14,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:14,217 INFO L351 BasicCegarLoop]: trace histogram [75, 74, 73, 73, 73, 73, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:14,217 INFO L371 AbstractCegarLoop]: === Iteration 83 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash 501749145, now seen corresponding path program 73 times [2018-02-04 15:08:14,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:14,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16137 backedges. 3927 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:16,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:16,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-02-04 15:08:16,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:16,128 INFO L182 omatonBuilderFactory]: Interpolants [49945#true, 49946#false, 49947#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 49948#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 49949#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 49950#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 49951#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 49952#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 49953#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 49954#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 49955#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 49956#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 49957#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 49958#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 49959#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 49960#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 49961#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 49962#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 49963#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 49964#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 49965#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 49966#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 49967#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 49968#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 49969#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 49970#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 49971#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 49972#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 49973#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 49974#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 49975#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 49976#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 49977#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 49978#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 49979#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 49980#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 49981#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 49982#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 49983#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 49984#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 38)), 49985#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 38)), 49986#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 37)), 49987#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 36)), 49988#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 49989#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 49990#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 49991#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 49992#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 49993#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 49994#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 49995#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 49996#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 49997#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 49998#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 49999#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 50000#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 50001#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 50002#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 50003#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 50004#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 50005#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 50006#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 50007#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 50008#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 50009#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 50010#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 50011#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 50012#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 50013#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 50014#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 50015#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 50016#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 50017#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 50018#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 50019#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 50020#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 50021#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 50022#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 50023#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:08:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16137 backedges. 3927 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:16,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 15:08:16,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 15:08:16,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1525, Invalid=4637, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 15:08:16,129 INFO L87 Difference]: Start difference. First operand 471 states and 548 transitions. Second operand 79 states. [2018-02-04 15:08:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:17,562 INFO L93 Difference]: Finished difference Result 720 states and 838 transitions. [2018-02-04 15:08:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 15:08:17,562 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 465 [2018-02-04 15:08:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:17,563 INFO L225 Difference]: With dead ends: 720 [2018-02-04 15:08:17,563 INFO L226 Difference]: Without dead ends: 493 [2018-02-04 15:08:17,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3158, Invalid=10414, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 15:08:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-02-04 15:08:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 483. [2018-02-04 15:08:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-02-04 15:08:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 563 transitions. [2018-02-04 15:08:17,566 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 563 transitions. Word has length 465 [2018-02-04 15:08:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:17,566 INFO L432 AbstractCegarLoop]: Abstraction has 483 states and 563 transitions. [2018-02-04 15:08:17,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 15:08:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 563 transitions. [2018-02-04 15:08:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-02-04 15:08:17,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:17,568 INFO L351 BasicCegarLoop]: trace histogram [76, 75, 74, 74, 74, 74, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:17,568 INFO L371 AbstractCegarLoop]: === Iteration 84 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1546434821, now seen corresponding path program 74 times [2018-02-04 15:08:17,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:17,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16580 backedges. 4109 proven. 12471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:19,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:19,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-02-04 15:08:19,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:19,779 INFO L182 omatonBuilderFactory]: Interpolants [51328#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 51329#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 51330#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 51331#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 51332#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 51333#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 51334#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 51335#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 51336#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 51337#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 51338#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 51339#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 51340#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 51341#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 51342#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 51343#(<= (+ SelectionSort_~i~0 38) SelectionSort_~j~0), 51344#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 156) (select |#length| SelectionSort_~a.base)), 51345#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 152) (select |#length| SelectionSort_~a.base)), 51346#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 148) (select |#length| SelectionSort_~a.base)), 51347#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 51348#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 51349#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 51350#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 51351#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 51352#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 51353#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 51354#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 51355#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 51356#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 51357#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 51358#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 51359#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 51360#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 51361#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 51362#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 51363#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 51364#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 51365#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 51366#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 51367#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 51368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 51369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 51370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 51371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 51372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 51373#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 51374#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 51375#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 51376#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 51377#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 51378#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 51379#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 51380#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 51381#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 51382#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 51383#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 51304#true, 51305#false, 51306#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 51307#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 51308#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 51309#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 51310#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 51311#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 51312#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 51313#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 51314#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 51315#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 51316#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 51317#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 51318#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 51319#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 51320#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 51321#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 51322#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 51323#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 51324#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 51325#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 51326#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 51327#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0)] [2018-02-04 15:08:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16580 backedges. 4109 proven. 12471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:19,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 15:08:19,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 15:08:19,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=4828, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 15:08:19,780 INFO L87 Difference]: Start difference. First operand 483 states and 563 transitions. Second operand 80 states. [2018-02-04 15:08:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:24,474 INFO L93 Difference]: Finished difference Result 486 states and 565 transitions. [2018-02-04 15:08:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 15:08:24,474 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 471 [2018-02-04 15:08:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:24,475 INFO L225 Difference]: With dead ends: 486 [2018-02-04 15:08:24,476 INFO L226 Difference]: Without dead ends: 486 [2018-02-04 15:08:24,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3212, Invalid=11308, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 15:08:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-04 15:08:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 483. [2018-02-04 15:08:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-02-04 15:08:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 562 transitions. [2018-02-04 15:08:24,478 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 562 transitions. Word has length 471 [2018-02-04 15:08:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:24,479 INFO L432 AbstractCegarLoop]: Abstraction has 483 states and 562 transitions. [2018-02-04 15:08:24,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 15:08:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 562 transitions. [2018-02-04 15:08:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-02-04 15:08:24,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:24,480 INFO L351 BasicCegarLoop]: trace histogram [77, 76, 75, 75, 75, 75, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:24,480 INFO L371 AbstractCegarLoop]: === Iteration 85 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:24,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1253253543, now seen corresponding path program 75 times [2018-02-04 15:08:24,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:24,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17029 backedges. 4147 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:26,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:26,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 15:08:26,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:26,593 INFO L182 omatonBuilderFactory]: Interpolants [52480#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 36)), 52481#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 52482#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 52483#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 52484#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 52485#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 52486#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 52487#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 52488#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 52489#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 52490#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 52491#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 52492#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 52493#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 52494#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 52495#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 52496#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 52497#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 52498#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 52499#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 52500#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 52501#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 52502#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 52503#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 52504#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 52505#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 52506#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 52507#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 52508#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 52509#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 52510#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 52511#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 52512#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 52513#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 52514#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 52515#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 52516#(<= SelectionSort_~array_size SelectionSort_~j~0), 52436#true, 52437#false, 52438#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 52439#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 52440#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 52441#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 52442#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 52443#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 52444#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 52445#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 52446#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 52447#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 52448#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 52449#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 52450#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 52451#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 52452#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 52453#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 52454#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 52455#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 52456#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 52457#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 52458#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 52459#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 52460#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 52461#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 52462#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 52463#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 52464#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 52465#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 52466#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 52467#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 52468#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 52469#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 52470#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 52471#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 52472#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 52473#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 52474#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 52475#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 38)), 52476#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 39)), 52477#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 39)), 52478#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 38)), 52479#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 37))] [2018-02-04 15:08:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17029 backedges. 4147 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:26,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 15:08:26,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 15:08:26,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1604, Invalid=4876, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 15:08:26,595 INFO L87 Difference]: Start difference. First operand 483 states and 562 transitions. Second operand 81 states. [2018-02-04 15:08:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:28,166 INFO L93 Difference]: Finished difference Result 738 states and 859 transitions. [2018-02-04 15:08:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 15:08:28,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 477 [2018-02-04 15:08:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:28,168 INFO L225 Difference]: With dead ends: 738 [2018-02-04 15:08:28,168 INFO L226 Difference]: Without dead ends: 505 [2018-02-04 15:08:28,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3319, Invalid=10961, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 15:08:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-04 15:08:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 495. [2018-02-04 15:08:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 15:08:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 577 transitions. [2018-02-04 15:08:28,171 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 577 transitions. Word has length 477 [2018-02-04 15:08:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:28,171 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 577 transitions. [2018-02-04 15:08:28,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 15:08:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 577 transitions. [2018-02-04 15:08:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-02-04 15:08:28,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:28,172 INFO L351 BasicCegarLoop]: trace histogram [78, 77, 76, 76, 76, 76, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:28,173 INFO L371 AbstractCegarLoop]: === Iteration 86 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1174683707, now seen corresponding path program 76 times [2018-02-04 15:08:28,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:28,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 4334 proven. 13150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:30,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:30,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 15:08:30,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:30,500 INFO L182 omatonBuilderFactory]: Interpolants [53888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 53889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 53890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 53891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 53892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 53893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 53894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 53895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 53896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 53897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 53898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 53899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 53900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 53901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 53902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 53903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 53904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 53905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 53906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 53907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 53908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 53909#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 53910#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 53829#true, 53830#false, 53831#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 53832#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 53833#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 53834#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 53835#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 53836#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 53837#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 53838#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 53839#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 53840#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 53841#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 53842#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 53843#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 53844#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 53845#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 53846#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 53847#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 53848#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 53849#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 53850#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 53851#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 53852#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 53853#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 53854#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 53855#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 53856#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 53857#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 53858#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 53859#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 53860#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 53861#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 53862#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 53863#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 53864#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 53865#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 53866#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 53867#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 53868#(<= (+ SelectionSort_~i~0 38) SelectionSort_~j~0), 53869#(<= (+ SelectionSort_~i~0 39) SelectionSort_~j~0), 53870#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 160) (select |#length| SelectionSort_~a.base)), 53871#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 156) (select |#length| SelectionSort_~a.base)), 53872#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 152) (select |#length| SelectionSort_~a.base)), 53873#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 148) (select |#length| SelectionSort_~a.base)), 53874#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 53875#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 53876#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 53877#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 53878#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 53879#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 53880#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 53881#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 53882#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 53883#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 53884#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 53885#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 53886#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 53887#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:08:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 4334 proven. 13150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:30,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-02-04 15:08:30,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-02-04 15:08:30,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1570, Invalid=5072, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 15:08:30,501 INFO L87 Difference]: Start difference. First operand 495 states and 577 transitions. Second operand 82 states. [2018-02-04 15:08:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:33,884 INFO L93 Difference]: Finished difference Result 498 states and 579 transitions. [2018-02-04 15:08:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-02-04 15:08:33,885 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 483 [2018-02-04 15:08:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:33,886 INFO L225 Difference]: With dead ends: 498 [2018-02-04 15:08:33,886 INFO L226 Difference]: Without dead ends: 498 [2018-02-04 15:08:33,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3374, Invalid=11878, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 15:08:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-02-04 15:08:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 495. [2018-02-04 15:08:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 15:08:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 576 transitions. [2018-02-04 15:08:33,889 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 576 transitions. Word has length 483 [2018-02-04 15:08:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:33,889 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 576 transitions. [2018-02-04 15:08:33,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-02-04 15:08:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 576 transitions. [2018-02-04 15:08:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-02-04 15:08:33,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:33,891 INFO L351 BasicCegarLoop]: trace histogram [79, 78, 77, 77, 77, 77, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:33,891 INFO L371 AbstractCegarLoop]: === Iteration 87 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1307301145, now seen corresponding path program 77 times [2018-02-04 15:08:33,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:33,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 17945 backedges. 4373 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:36,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:36,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-02-04 15:08:36,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:36,028 INFO L182 omatonBuilderFactory]: Interpolants [55040#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 55041#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 55042#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 55043#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 55044#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 55045#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 55046#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 55047#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 55048#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 55049#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 55050#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 55051#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 55052#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 55053#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 55054#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 55055#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 55056#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 55057#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 55058#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 55059#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 55060#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 55061#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 55062#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 55063#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 55064#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 55065#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 55066#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 55067#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 55068#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 55069#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 55070#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 55071#(<= SelectionSort_~array_size SelectionSort_~j~0), 54989#true, 54990#false, 54991#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 54992#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 54993#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 54994#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 54995#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 54996#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 54997#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 54998#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 54999#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 55000#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 55001#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 55002#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 55003#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 55004#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 55005#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 55006#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 55007#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 55008#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 55009#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 55010#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 55011#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 55012#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 55013#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 55014#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 55015#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 55016#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 55017#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 55018#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 55019#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 55020#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 55021#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 55022#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 55023#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 55024#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 55025#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 55026#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 55027#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 55028#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 38)), 55029#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 39)), 55030#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 40)), 55031#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 40)), 55032#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 39)), 55033#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 38)), 55034#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 37)), 55035#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 36)), 55036#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 55037#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 55038#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 55039#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32))] [2018-02-04 15:08:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 17945 backedges. 4373 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:36,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 15:08:36,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 15:08:36,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=5121, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 15:08:36,029 INFO L87 Difference]: Start difference. First operand 495 states and 576 transitions. Second operand 83 states. [2018-02-04 15:08:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:37,615 INFO L93 Difference]: Finished difference Result 756 states and 880 transitions. [2018-02-04 15:08:37,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 15:08:37,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 489 [2018-02-04 15:08:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:37,617 INFO L225 Difference]: With dead ends: 756 [2018-02-04 15:08:37,617 INFO L226 Difference]: Without dead ends: 517 [2018-02-04 15:08:37,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3484, Invalid=11522, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 15:08:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-04 15:08:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 507. [2018-02-04 15:08:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-04 15:08:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 591 transitions. [2018-02-04 15:08:37,620 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 591 transitions. Word has length 489 [2018-02-04 15:08:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:37,621 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 591 transitions. [2018-02-04 15:08:37,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 15:08:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 591 transitions. [2018-02-04 15:08:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-02-04 15:08:37,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:37,622 INFO L351 BasicCegarLoop]: trace histogram [80, 79, 78, 78, 78, 78, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:37,622 INFO L371 AbstractCegarLoop]: === Iteration 88 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2053639035, now seen corresponding path program 78 times [2018-02-04 15:08:37,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:37,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18412 backedges. 4565 proven. 13847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:40,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:40,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-02-04 15:08:40,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:40,205 INFO L182 omatonBuilderFactory]: Interpolants [56448#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 56449#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 56450#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 56451#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 56452#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 56453#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 56454#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 56455#(<= (+ SelectionSort_~i~0 38) SelectionSort_~j~0), 56456#(<= (+ SelectionSort_~i~0 39) SelectionSort_~j~0), 56457#(<= (+ SelectionSort_~i~0 40) SelectionSort_~j~0), 56458#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 164) (select |#length| SelectionSort_~a.base)), 56459#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 160) (select |#length| SelectionSort_~a.base)), 56460#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 156) (select |#length| SelectionSort_~a.base)), 56461#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 152) (select |#length| SelectionSort_~a.base)), 56462#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 148) (select |#length| SelectionSort_~a.base)), 56463#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 56464#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 56465#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 56466#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 56467#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 56468#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 56469#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 56470#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 56471#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 56472#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 56473#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 56474#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 56475#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 56476#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 56477#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 56478#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 56479#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 56480#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 56481#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 56482#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 56483#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 56484#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 56485#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 56486#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 56487#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 56488#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 56489#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 56490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 56491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 56492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 56493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 56494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 56495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 56496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 56497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 56498#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 56499#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 56416#true, 56417#false, 56418#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 56419#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 56420#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 56421#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 56422#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 56423#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 56424#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 56425#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 56426#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 56427#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 56428#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 56429#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 56430#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 56431#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 56432#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 56433#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 56434#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 56435#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 56436#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 56437#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 56438#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 56439#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 56440#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 56441#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 56442#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 56443#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 56444#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 56445#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 56446#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 56447#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0)] [2018-02-04 15:08:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18412 backedges. 4565 proven. 13847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:40,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 15:08:40,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 15:08:40,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1650, Invalid=5322, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 15:08:40,206 INFO L87 Difference]: Start difference. First operand 507 states and 591 transitions. Second operand 84 states. [2018-02-04 15:08:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:45,302 INFO L93 Difference]: Finished difference Result 510 states and 593 transitions. [2018-02-04 15:08:45,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-02-04 15:08:45,302 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 495 [2018-02-04 15:08:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:45,303 INFO L225 Difference]: With dead ends: 510 [2018-02-04 15:08:45,304 INFO L226 Difference]: Without dead ends: 510 [2018-02-04 15:08:45,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3434 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3540, Invalid=12462, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 15:08:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-02-04 15:08:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 507. [2018-02-04 15:08:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-02-04 15:08:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 590 transitions. [2018-02-04 15:08:45,307 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 590 transitions. Word has length 495 [2018-02-04 15:08:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:45,307 INFO L432 AbstractCegarLoop]: Abstraction has 507 states and 590 transitions. [2018-02-04 15:08:45,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 15:08:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 590 transitions. [2018-02-04 15:08:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-02-04 15:08:45,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:45,309 INFO L351 BasicCegarLoop]: trace histogram [81, 80, 79, 79, 79, 79, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:45,309 INFO L371 AbstractCegarLoop]: === Iteration 89 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1698527705, now seen corresponding path program 79 times [2018-02-04 15:08:45,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:45,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18885 backedges. 4605 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:47,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:47,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-02-04 15:08:47,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:47,601 INFO L182 omatonBuilderFactory]: Interpolants [57604#true, 57605#false, 57606#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 57607#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 57608#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 57609#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 57610#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 57611#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 57612#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 57613#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 57614#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 57615#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 57616#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 57617#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 57618#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 57619#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 57620#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 57621#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 57622#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 57623#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 57624#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 57625#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 57626#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 57627#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 57628#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 57629#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 57630#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 57631#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 57632#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 57633#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 57634#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 57635#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 57636#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 57637#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 57638#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 57639#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 57640#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 57641#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 57642#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 57643#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 38)), 57644#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 39)), 57645#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 40)), 57646#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 41)), 57647#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 41)), 57648#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 40)), 57649#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 39)), 57650#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 38)), 57651#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 37)), 57652#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 36)), 57653#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 57654#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 57655#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 57656#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 57657#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 57658#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 57659#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 57660#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 57661#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 57662#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 57663#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 57664#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 57665#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 57666#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 57667#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 57668#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 57669#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 57670#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 57671#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 57672#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 57673#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 57674#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 57675#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 57676#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 57677#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 57678#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 57679#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 57680#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 57681#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 57682#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 57683#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 57684#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 57685#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 57686#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 57687#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 57688#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-04 15:08:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18885 backedges. 4605 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:47,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 15:08:47,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 15:08:47,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1768, Invalid=5372, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:08:47,602 INFO L87 Difference]: Start difference. First operand 507 states and 590 transitions. Second operand 85 states. [2018-02-04 15:08:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:49,281 INFO L93 Difference]: Finished difference Result 774 states and 901 transitions. [2018-02-04 15:08:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 15:08:49,281 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 501 [2018-02-04 15:08:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:49,282 INFO L225 Difference]: With dead ends: 774 [2018-02-04 15:08:49,282 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 15:08:49,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3653, Invalid=12097, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 15:08:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 15:08:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 519. [2018-02-04 15:08:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 15:08:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 605 transitions. [2018-02-04 15:08:49,286 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 605 transitions. Word has length 501 [2018-02-04 15:08:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:49,286 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 605 transitions. [2018-02-04 15:08:49,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 15:08:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 605 transitions. [2018-02-04 15:08:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-02-04 15:08:49,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:49,288 INFO L351 BasicCegarLoop]: trace histogram [82, 81, 80, 80, 80, 80, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:49,288 INFO L371 AbstractCegarLoop]: === Iteration 90 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -134621371, now seen corresponding path program 80 times [2018-02-04 15:08:49,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:49,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19364 backedges. 4802 proven. 14562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:51,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:51,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-02-04 15:08:51,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:51,914 INFO L182 omatonBuilderFactory]: Interpolants [59136#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 59137#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 59138#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 59139#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 59140#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 59141#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 59142#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 59143#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 59144#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 59145#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 59146#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 59147#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 59148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 59149#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 59150#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 59065#true, 59066#false, 59067#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 59068#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 59069#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 59070#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 59071#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 59072#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 59073#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 59074#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 59075#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 59076#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 59077#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 59078#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 59079#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 59080#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 59081#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 59082#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 59083#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 59084#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 59085#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 59086#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 59087#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 59088#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 59089#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 59090#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 59091#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 59092#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 59093#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 59094#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 59095#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 59096#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 59097#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 59098#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 59099#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 59100#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 59101#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 59102#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 59103#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 59104#(<= (+ SelectionSort_~i~0 38) SelectionSort_~j~0), 59105#(<= (+ SelectionSort_~i~0 39) SelectionSort_~j~0), 59106#(<= (+ SelectionSort_~i~0 40) SelectionSort_~j~0), 59107#(<= (+ SelectionSort_~i~0 41) SelectionSort_~j~0), 59108#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 168) (select |#length| SelectionSort_~a.base)), 59109#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 164) (select |#length| SelectionSort_~a.base)), 59110#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 160) (select |#length| SelectionSort_~a.base)), 59111#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 156) (select |#length| SelectionSort_~a.base)), 59112#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 152) (select |#length| SelectionSort_~a.base)), 59113#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 148) (select |#length| SelectionSort_~a.base)), 59114#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 59115#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 59116#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 59117#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 59118#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 59119#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 59120#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 59121#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 59122#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 59123#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 59124#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 59125#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 59126#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 59127#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 59128#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 59129#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 59130#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 59131#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 59132#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 59133#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 59134#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 59135#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:08:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19364 backedges. 4802 proven. 14562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:51,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 15:08:51,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 15:08:51,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1732, Invalid=5578, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 15:08:51,916 INFO L87 Difference]: Start difference. First operand 519 states and 605 transitions. Second operand 86 states. [2018-02-04 15:08:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:54,959 INFO L93 Difference]: Finished difference Result 522 states and 607 transitions. [2018-02-04 15:08:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 15:08:54,960 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 507 [2018-02-04 15:08:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:54,961 INFO L225 Difference]: With dead ends: 522 [2018-02-04 15:08:54,961 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 15:08:54,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3602 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3710, Invalid=13060, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 15:08:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 15:08:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2018-02-04 15:08:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 15:08:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 604 transitions. [2018-02-04 15:08:54,964 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 604 transitions. Word has length 507 [2018-02-04 15:08:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:54,964 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 604 transitions. [2018-02-04 15:08:54,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 15:08:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 604 transitions. [2018-02-04 15:08:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-02-04 15:08:54,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:54,966 INFO L351 BasicCegarLoop]: trace histogram [83, 82, 81, 81, 81, 81, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:54,966 INFO L371 AbstractCegarLoop]: === Iteration 91 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1210430311, now seen corresponding path program 81 times [2018-02-04 15:08:54,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:55,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:08:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19849 backedges. 4843 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:57,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:08:57,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-02-04 15:08:57,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:08:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:57,313 INFO L182 omatonBuilderFactory]: Interpolants [60288#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 60289#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 60290#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 60291#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 60292#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 60293#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 60294#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 60295#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 60296#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 60297#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 60298#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 60299#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 60300#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 60301#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 60302#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 60303#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 60304#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 60305#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 60306#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 60307#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 60308#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 60309#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 27)), 60310#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 28)), 60311#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 29)), 60312#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 30)), 60313#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 31)), 60314#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 32)), 60315#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 33)), 60316#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 34)), 60317#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 35)), 60318#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 36)), 60319#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 37)), 60320#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 38)), 60321#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 39)), 60322#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 40)), 60323#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 41)), 60324#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 42)), 60325#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 42)), 60326#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 41)), 60327#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 40)), 60328#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 39)), 60329#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 38)), 60330#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 37)), 60331#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 36)), 60332#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 35)), 60333#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 34)), 60334#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 33)), 60335#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 32)), 60336#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 31)), 60337#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 30)), 60338#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 29)), 60339#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 28)), 60340#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 27)), 60341#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 26)), 60342#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 25)), 60343#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 60344#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 60345#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 60346#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 60347#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 60348#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 60349#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 60350#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 60351#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 60352#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 60353#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 60354#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 60355#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 60356#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 60357#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 60358#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 60359#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 60360#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 60361#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 60362#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 60363#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 60364#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 60365#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 60366#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 60367#(<= SelectionSort_~array_size SelectionSort_~j~0), 60281#true, 60282#false, 60283#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 60284#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 60285#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 60286#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 60287#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-04 15:08:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 19849 backedges. 4843 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:08:57,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 15:08:57,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 15:08:57,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1853, Invalid=5629, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 15:08:57,314 INFO L87 Difference]: Start difference. First operand 519 states and 604 transitions. Second operand 87 states. [2018-02-04 15:08:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:08:58,825 INFO L93 Difference]: Finished difference Result 792 states and 922 transitions. [2018-02-04 15:08:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 15:08:58,825 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 513 [2018-02-04 15:08:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:08:58,826 INFO L225 Difference]: With dead ends: 792 [2018-02-04 15:08:58,827 INFO L226 Difference]: Without dead ends: 541 [2018-02-04 15:08:58,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3826, Invalid=12686, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 15:08:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-04 15:08:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 531. [2018-02-04 15:08:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-04 15:08:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 619 transitions. [2018-02-04 15:08:58,829 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 619 transitions. Word has length 513 [2018-02-04 15:08:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:08:58,830 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 619 transitions. [2018-02-04 15:08:58,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 15:08:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 619 transitions. [2018-02-04 15:08:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-02-04 15:08:58,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:08:58,831 INFO L351 BasicCegarLoop]: trace histogram [84, 83, 82, 82, 82, 82, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:08:58,831 INFO L371 AbstractCegarLoop]: === Iteration 92 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:08:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1228531717, now seen corresponding path program 82 times [2018-02-04 15:08:58,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:08:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:08:58,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:09:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20340 backedges. 5045 proven. 15295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:01,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:09:01,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-02-04 15:09:01,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:09:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:01,500 INFO L182 omatonBuilderFactory]: Interpolants [61824#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 156) (select |#length| SelectionSort_~a.base)), 61825#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 152) (select |#length| SelectionSort_~a.base)), 61826#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 148) (select |#length| SelectionSort_~a.base)), 61827#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 144) (select |#length| SelectionSort_~a.base)), 61828#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 140) (select |#length| SelectionSort_~a.base)), 61829#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 136) (select |#length| SelectionSort_~a.base)), 61830#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 132) (select |#length| SelectionSort_~a.base)), 61831#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 128) (select |#length| SelectionSort_~a.base)), 61832#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 124) (select |#length| SelectionSort_~a.base)), 61833#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 120) (select |#length| SelectionSort_~a.base)), 61834#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 116) (select |#length| SelectionSort_~a.base)), 61835#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 112) (select |#length| SelectionSort_~a.base)), 61836#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 108) (select |#length| SelectionSort_~a.base)), 61837#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 104) (select |#length| SelectionSort_~a.base)), 61838#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 61839#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 61840#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 61841#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 61842#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 61843#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 61844#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 61845#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 61846#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 61847#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 61848#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 61849#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 61850#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 61851#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 61852#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 61853#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 61854#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 61855#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 61856#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 61857#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 61858#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 61859#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 61860#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 61861#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 61862#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 61863#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 61776#true, 61777#false, 61778#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 61779#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 61780#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 61781#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 61782#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 61783#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 61784#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 61785#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 61786#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 61787#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 61788#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 61789#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 61790#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 61791#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 61792#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 61793#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 61794#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 61795#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 61796#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 61797#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 61798#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 61799#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 61800#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 61801#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 61802#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 61803#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 61804#(<= (+ SelectionSort_~i~0 27) SelectionSort_~j~0), 61805#(<= (+ SelectionSort_~i~0 28) SelectionSort_~j~0), 61806#(<= (+ SelectionSort_~i~0 29) SelectionSort_~j~0), 61807#(<= (+ SelectionSort_~i~0 30) SelectionSort_~j~0), 61808#(<= (+ SelectionSort_~i~0 31) SelectionSort_~j~0), 61809#(<= (+ SelectionSort_~i~0 32) SelectionSort_~j~0), 61810#(<= (+ SelectionSort_~i~0 33) SelectionSort_~j~0), 61811#(<= (+ SelectionSort_~i~0 34) SelectionSort_~j~0), 61812#(<= (+ SelectionSort_~i~0 35) SelectionSort_~j~0), 61813#(<= (+ SelectionSort_~i~0 36) SelectionSort_~j~0), 61814#(<= (+ SelectionSort_~i~0 37) SelectionSort_~j~0), 61815#(<= (+ SelectionSort_~i~0 38) SelectionSort_~j~0), 61816#(<= (+ SelectionSort_~i~0 39) SelectionSort_~j~0), 61817#(<= (+ SelectionSort_~i~0 40) SelectionSort_~j~0), 61818#(<= (+ SelectionSort_~i~0 41) SelectionSort_~j~0), 61819#(<= (+ SelectionSort_~i~0 42) SelectionSort_~j~0), 61820#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 172) (select |#length| SelectionSort_~a.base)), 61821#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 168) (select |#length| SelectionSort_~a.base)), 61822#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 164) (select |#length| SelectionSort_~a.base)), 61823#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 160) (select |#length| SelectionSort_~a.base))] [2018-02-04 15:09:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20340 backedges. 5045 proven. 15295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:09:01,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-02-04 15:09:01,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-02-04 15:09:01,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1816, Invalid=5840, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 15:09:01,501 INFO L87 Difference]: Start difference. First operand 531 states and 619 transitions. Second operand 88 states. [2018-02-04 15:09:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:09:07,124 INFO L93 Difference]: Finished difference Result 534 states and 621 transitions. [2018-02-04 15:09:07,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-04 15:09:07,124 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 519 [2018-02-04 15:09:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:09:07,126 INFO L225 Difference]: With dead ends: 534 [2018-02-04 15:09:07,126 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 15:09:07,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3884, Invalid=13672, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 15:09:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 15:09:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2018-02-04 15:09:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-02-04 15:09:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 618 transitions. [2018-02-04 15:09:07,129 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 618 transitions. Word has length 519 [2018-02-04 15:09:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:09:07,129 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 618 transitions. [2018-02-04 15:09:07,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-02-04 15:09:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 618 transitions. [2018-02-04 15:09:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-02-04 15:09:07,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:09:07,131 INFO L351 BasicCegarLoop]: trace histogram [85, 84, 83, 83, 83, 83, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:09:07,131 INFO L371 AbstractCegarLoop]: === Iteration 93 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:09:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash 695913817, now seen corresponding path program 83 times [2018-02-04 15:09:07,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:09:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:09:07,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 15:09:09,243 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 15:09:09,247 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 15:09:09,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:09:09 BoogieIcfgContainer [2018-02-04 15:09:09,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:09:09,247 INFO L168 Benchmark]: Toolchain (without parser) took 192490.30 ms. Allocated memory was 407.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 365.6 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 499.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:09:09,248 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 407.4 MB. Free memory is still 370.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:09:09,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.20 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:09:09,248 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 ms. Allocated memory is still 407.4 MB. Free memory was 353.6 MB in the beginning and 352.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:09:09,249 INFO L168 Benchmark]: RCFGBuilder took 173.06 ms. Allocated memory is still 407.4 MB. Free memory was 352.3 MB in the beginning and 334.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:09:09,249 INFO L168 Benchmark]: TraceAbstraction took 192146.01 ms. Allocated memory was 407.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.0 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 467.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:09:09,250 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 407.4 MB. Free memory is still 370.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.20 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.21 ms. Allocated memory is still 407.4 MB. Free memory was 353.6 MB in the beginning and 352.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 173.06 ms. Allocated memory is still 407.4 MB. Free memory was 352.3 MB in the beginning and 334.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 192146.01 ms. Allocated memory was 407.4 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 333.0 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 467.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 526 with TraceHistMax 85, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 79 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. TIMEOUT Result, 192.1s OverallTime, 93 OverallIterations, 85 TraceHistogramMax, 111.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8804 SDtfs, 60265 SDslu, 137181 SDs, 0 SdLazy, 255619 SolverSat, 7571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5957 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 5736 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105771 ImplicationChecksByTransitivity, 67.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 138920/568659 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 92 MinimizatonAttempts, 701 StatesRemovedByMinimization, 88 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 69.0s InterpolantComputationTime, 22840 NumberOfCodeBlocks, 22840 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 22748 ConstructedInterpolants, 0 QuantifiedInterpolants, 48555877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 92 InterpolantComputations, 6 PerfectInterpolantSequences, 138920/568659 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-09-09-255.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-09-09-255.csv Completed graceful shutdown