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-a74eeac-m [2018-02-02 19:55:32,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:55:32,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:55:32,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:55:32,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:55:32,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:55:32,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:55:32,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:55:32,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:55:32,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:55:32,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:55:32,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:55:32,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:55:32,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:55:32,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:55:32,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:55:32,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:55:32,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:55:32,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:55:32,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:55:33,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:55:33,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:55:33,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:55:33,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:55:33,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:55:33,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:55:33,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:55:33,003 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:55:33,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:55:33,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:55:33,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:55:33,004 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-02 19:55:33,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:55:33,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:55:33,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:55:33,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:55:33,015 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:55:33,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:55:33,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:55:33,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:55:33,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:55:33,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:55:33,050 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:55:33,053 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:55:33,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:55:33,054 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:55:33,054 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-02 19:55:33,181 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:55:33,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:55:33,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:55:33,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:55:33,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:55:33,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421f655e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33, skipping insertion in model container [2018-02-02 19:55:33,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,207 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:55:33,236 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:55:33,324 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:55:33,335 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:55:33,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33 WrapperNode [2018-02-02 19:55:33,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:55:33,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:55:33,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:55:33,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:55:33,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (1/1) ... [2018-02-02 19:55:33,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:55:33,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:55:33,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:55:33,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:55:33,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (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-02 19:55:33,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:55:33,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:55:33,395 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-02-02 19:55:33,395 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:55:33,395 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:55:33,395 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:55:33,395 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:55:33,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:55:33,538 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:55:33,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:55:33 BoogieIcfgContainer [2018-02-02 19:55:33,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:55:33,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:55:33,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:55:33,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:55:33,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:55:33" (1/3) ... [2018-02-02 19:55:33,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b92569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:55:33, skipping insertion in model container [2018-02-02 19:55:33,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:55:33" (2/3) ... [2018-02-02 19:55:33,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b92569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:55:33, skipping insertion in model container [2018-02-02 19:55:33,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:55:33" (3/3) ... [2018-02-02 19:55:33,543 INFO L107 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:55:33,548 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:55:33,552 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 19:55:33,579 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:55:33,579 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:55:33,579 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:55:33,580 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:55:33,580 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:55:33,580 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:55:33,580 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:55:33,580 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:55:33,581 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:55:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-02 19:55:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:55:33,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:33,603 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:55:33,603 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-02-02 19:55:33,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:33,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:33,727 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-02 19:55:33,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:33,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:55:33,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:33,731 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-02 19:55:33,732 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false] [2018-02-02 19:55:33,732 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-02 19:55:33,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 19:55:33,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 19:55:33,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 19:55:33,747 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-02-02 19:55:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:33,763 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-02 19:55:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 19:55:33,764 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-02-02 19:55:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:33,773 INFO L225 Difference]: With dead ends: 48 [2018-02-02 19:55:33,773 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 19:55:33,775 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-02 19:55:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 19:55:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 19:55:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 19:55:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-02 19:55:33,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-02-02 19:55:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:33,856 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-02 19:55:33,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 19:55:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-02 19:55:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 19:55:33,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:33,857 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:55:33,857 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-02-02 19:55:33,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:33,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:33,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-02 19:55:33,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:33,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:55:33,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:33,929 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-02 19:55:33,929 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-02 19:55:33,929 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-02 19:55:33,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:55:33,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:55:33,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:55:33,931 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-02-02 19:55:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,024 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 19:55:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:55:34,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 19:55:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,025 INFO L225 Difference]: With dead ends: 39 [2018-02-02 19:55:34,025 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 19:55:34,026 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-02 19:55:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 19:55:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 19:55:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 19:55:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 19:55:34,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-02-02 19:55:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,031 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 19:55:34,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:55:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 19:55:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 19:55:34,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,032 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:55:34,032 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-02-02 19:55:34,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,064 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-02 19:55:34,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:34,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:55:34,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,065 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-02 19:55:34,065 INFO L182 omatonBuilderFactory]: Interpolants [234#true, 235#false, 236#(<= (+ SelectionSort_~j~0 1) SelectionSort_~array_size)] [2018-02-02 19:55:34,065 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-02 19:55:34,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:55:34,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:55:34,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:55:34,066 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-02-02 19:55:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,080 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 19:55:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:55:34,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 19:55:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,081 INFO L225 Difference]: With dead ends: 41 [2018-02-02 19:55:34,081 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 19:55:34,081 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-02 19:55:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 19:55:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 19:55:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 19:55:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 19:55:34,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-02-02 19:55:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,084 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 19:55:34,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:55:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 19:55:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 19:55:34,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,085 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:55:34,085 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-02-02 19:55:34,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,190 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-02 19:55:34,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:34,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:55:34,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,191 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-02 19:55:34,191 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-02 19:55:34,191 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-02 19:55:34,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:34,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:34,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:34,192 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-02-02 19:55:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,408 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 19:55:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:55:34,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 19:55:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,412 INFO L225 Difference]: With dead ends: 69 [2018-02-02 19:55:34,412 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 19:55:34,413 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-02 19:55:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 19:55:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-02 19:55:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 19:55:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 19:55:34,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-02-02 19:55:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,421 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 19:55:34,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 19:55:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:55:34,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:55:34,422 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-02-02 19:55:34,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,502 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-02 19:55:34,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:34,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:55:34,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,503 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-02 19:55:34,503 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-02 19:55:34,503 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-02 19:55:34,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:34,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:34,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:34,504 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-02 19:55:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,630 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-02 19:55:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:55:34,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 19:55:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,631 INFO L225 Difference]: With dead ends: 83 [2018-02-02 19:55:34,631 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 19:55:34,631 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-02 19:55:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 19:55:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-02 19:55:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:55:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-02 19:55:34,636 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-02-02 19:55:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,636 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-02 19:55:34,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-02 19:55:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 19:55:34,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,637 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-02 19:55:34,637 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-02-02 19:55:34,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,684 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-02 19:55:34,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:34,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:55:34,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,685 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-02 19:55:34,685 INFO L182 omatonBuilderFactory]: Interpolants [624#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|), 621#true, 622#false, 623#(= |#valid| |old(#valid)|)] [2018-02-02 19:55:34,685 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-02 19:55:34,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:55:34,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:55:34,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:55:34,686 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-02-02 19:55:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,727 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-02-02 19:55:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:55:34,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 19:55:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,727 INFO L225 Difference]: With dead ends: 62 [2018-02-02 19:55:34,727 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 19:55:34,728 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-02 19:55:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 19:55:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 19:55:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:55:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-02-02 19:55:34,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-02-02 19:55:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,730 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-02-02 19:55:34,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:55:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-02-02 19:55:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:55:34,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,730 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-02 19:55:34,731 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-02-02 19:55:34,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,796 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-02 19:55:34,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:34,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:55:34,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,797 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-02 19:55:34,797 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-02 19:55:34,797 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-02 19:55:34,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:34,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:34,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:34,798 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 8 states. [2018-02-02 19:55:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,913 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 19:55:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:55:34,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 19:55:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,914 INFO L225 Difference]: With dead ends: 67 [2018-02-02 19:55:34,914 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 19:55:34,915 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-02 19:55:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 19:55:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-02 19:55:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:55:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-02 19:55:34,918 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-02-02 19:55:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,919 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-02 19:55:34,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-02 19:55:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:55:34,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,919 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-02 19:55:34,920 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:34,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-02-02 19:55:34,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,970 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-02 19:55:34,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:34,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 19:55:34,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,970 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-02 19:55:34,970 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-02 19:55:34,971 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-02 19:55:34,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:55:34,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:55:34,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:55:34,971 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-02 19:55:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,030 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-02 19:55:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:55:35,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 19:55:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,031 INFO L225 Difference]: With dead ends: 107 [2018-02-02 19:55:35,031 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 19:55:35,031 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-02 19:55:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 19:55:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2018-02-02 19:55:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 19:55:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-02-02 19:55:35,034 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 23 [2018-02-02 19:55:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,034 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-02-02 19:55:35,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:55:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-02-02 19:55:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:55:35,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,035 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-02 19:55:35,035 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1011769969, now seen corresponding path program 1 times [2018-02-02 19:55:35,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:35,129 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-02 19:55:35,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:35,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 19:55:35,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:35,129 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-02 19:55:35,129 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-02 19:55:35,129 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-02 19:55:35,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:55:35,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:55:35,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:55:35,130 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 10 states. [2018-02-02 19:55:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,304 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-02-02 19:55:35,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:55:35,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-02 19:55:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,306 INFO L225 Difference]: With dead ends: 94 [2018-02-02 19:55:35,306 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 19:55:35,306 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-02 19:55:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 19:55:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2018-02-02 19:55:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:55:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-02-02 19:55:35,310 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 24 [2018-02-02 19:55:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,310 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-02-02 19:55:35,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:55:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-02-02 19:55:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:55:35,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,312 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-02 19:55:35,312 INFO L371 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1016956569, now seen corresponding path program 1 times [2018-02-02 19:55:35,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:35,360 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-02 19:55:35,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:35,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 19:55:35,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:35,361 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-02 19:55:35,361 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-02 19:55:35,361 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-02 19:55:35,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:55:35,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:55:35,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:55:35,362 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2018-02-02 19:55:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,395 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-02-02 19:55:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:55:35,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 19:55:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,396 INFO L225 Difference]: With dead ends: 114 [2018-02-02 19:55:35,396 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 19:55:35,397 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-02 19:55:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 19:55:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-02-02 19:55:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 19:55:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2018-02-02 19:55:35,399 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 33 [2018-02-02 19:55:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,400 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2018-02-02 19:55:35,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:55:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2018-02-02 19:55:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:55:35,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,400 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-02 19:55:35,400 INFO L371 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1805684219, now seen corresponding path program 2 times [2018-02-02 19:55:35,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:35,483 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-02 19:55:35,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:35,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:55:35,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:35,484 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-02 19:55:35,484 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-02 19:55:35,484 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-02 19:55:35,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:35,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:35,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:35,485 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 8 states. [2018-02-02 19:55:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,620 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-02 19:55:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:55:35,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 19:55:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,621 INFO L225 Difference]: With dead ends: 93 [2018-02-02 19:55:35,622 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 19:55:35,623 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-02 19:55:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 19:55:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-02-02 19:55:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:55:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-02-02 19:55:35,625 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 39 [2018-02-02 19:55:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,626 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-02-02 19:55:35,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-02-02 19:55:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 19:55:35,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,626 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-02 19:55:35,626 INFO L371 AbstractCegarLoop]: === Iteration 12 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash -141635977, now seen corresponding path program 1 times [2018-02-02 19:55:35,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:35,694 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-02 19:55:35,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:35,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:55:35,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:35,695 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-02 19:55:35,695 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-02 19:55:35,695 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-02 19:55:35,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:35,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:35,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:35,696 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 8 states. [2018-02-02 19:55:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,839 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-02 19:55:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:55:35,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 19:55:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,839 INFO L225 Difference]: With dead ends: 88 [2018-02-02 19:55:35,839 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 19:55:35,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 19:55:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-02-02 19:55:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 19:55:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 19:55:35,841 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 40 [2018-02-02 19:55:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,842 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 19:55:35,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 19:55:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:55:35,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,842 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-02 19:55:35,842 INFO L371 AbstractCegarLoop]: === Iteration 13 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash -523184295, now seen corresponding path program 3 times [2018-02-02 19:55:35,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:35,900 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-02 19:55:35,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:35,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 19:55:35,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:35,900 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-02 19:55:35,901 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-02 19:55:35,901 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-02 19:55:35,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:55:35,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:55:35,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:55:35,901 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 9 states. [2018-02-02 19:55:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,963 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-02 19:55:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:55:35,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-02 19:55:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,964 INFO L225 Difference]: With dead ends: 90 [2018-02-02 19:55:35,964 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 19:55:35,964 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-02 19:55:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 19:55:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-02-02 19:55:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:55:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-02-02 19:55:35,968 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 45 [2018-02-02 19:55:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,968 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-02-02 19:55:35,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:55:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-02-02 19:55:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 19:55:35,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,969 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-02 19:55:35,969 INFO L371 AbstractCegarLoop]: === Iteration 14 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2058288955, now seen corresponding path program 4 times [2018-02-02 19:55:35,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:36,066 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-02 19:55:36,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:36,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 19:55:36,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:36,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-02 19:55:36,067 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-02 19:55:36,067 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-02 19:55:36,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:55:36,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:55:36,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:55:36,068 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 10 states. [2018-02-02 19:55:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:36,205 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-02-02 19:55:36,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:55:36,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-02 19:55:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:36,206 INFO L225 Difference]: With dead ends: 66 [2018-02-02 19:55:36,206 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 19:55:36,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 19:55:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-02-02 19:55:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:55:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-02 19:55:36,209 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2018-02-02 19:55:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:36,209 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-02 19:55:36,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:55:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-02 19:55:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 19:55:36,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:36,210 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-02 19:55:36,210 INFO L371 AbstractCegarLoop]: === Iteration 15 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash -91466215, now seen corresponding path program 5 times [2018-02-02 19:55:36,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:36,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:36,288 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-02 19:55:36,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:36,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:55:36,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:36,288 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-02 19:55:36,289 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-02 19:55:36,289 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-02 19:55:36,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:55:36,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:55:36,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:55:36,289 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 11 states. [2018-02-02 19:55:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:36,389 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-02-02 19:55:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:55:36,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-02 19:55:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:36,390 INFO L225 Difference]: With dead ends: 108 [2018-02-02 19:55:36,390 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 19:55:36,390 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-02 19:55:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 19:55:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-02-02 19:55:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:55:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-02-02 19:55:36,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 57 [2018-02-02 19:55:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:36,393 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-02-02 19:55:36,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:55:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-02-02 19:55:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 19:55:36,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:36,394 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-02 19:55:36,394 INFO L371 AbstractCegarLoop]: === Iteration 16 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2052963717, now seen corresponding path program 6 times [2018-02-02 19:55:36,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:36,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:36,538 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-02 19:55:36,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:36,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:55:36,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:36,541 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-02 19:55:36,542 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-02 19:55:36,542 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-02 19:55:36,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:55:36,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:55:36,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:55:36,543 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2018-02-02 19:55:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:36,756 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-02-02 19:55:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:55:36,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 19:55:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:36,757 INFO L225 Difference]: With dead ends: 78 [2018-02-02 19:55:36,757 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 19:55:36,758 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-02 19:55:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 19:55:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-02-02 19:55:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:55:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-02-02 19:55:36,760 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 63 [2018-02-02 19:55:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:36,760 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-02-02 19:55:36,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:55:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-02-02 19:55:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 19:55:36,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:36,761 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-02 19:55:36,761 INFO L371 AbstractCegarLoop]: === Iteration 17 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1228373287, now seen corresponding path program 7 times [2018-02-02 19:55:36,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:36,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:36,857 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-02 19:55:36,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:36,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:55:36,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:36,858 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-02 19:55:36,858 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-02 19:55:36,858 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-02 19:55:36,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:55:36,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:55:36,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:55:36,859 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 13 states. [2018-02-02 19:55:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:36,985 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-02 19:55:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:55:36,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-02-02 19:55:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:36,985 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:55:36,986 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 19:55:36,986 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-02 19:55:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 19:55:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-02-02 19:55:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 19:55:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-02 19:55:36,988 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 69 [2018-02-02 19:55:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:36,988 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-02 19:55:36,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:55:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-02 19:55:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 19:55:36,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:36,989 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-02 19:55:36,989 INFO L371 AbstractCegarLoop]: === Iteration 18 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1543383109, now seen corresponding path program 8 times [2018-02-02 19:55:36,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:37,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:37,126 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-02 19:55:37,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:37,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:55:37,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:37,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-02 19:55:37,127 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-02 19:55:37,127 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-02 19:55:37,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:55:37,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:55:37,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:55:37,128 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 14 states. [2018-02-02 19:55:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:37,408 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-02 19:55:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:55:37,408 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2018-02-02 19:55:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:37,408 INFO L225 Difference]: With dead ends: 90 [2018-02-02 19:55:37,408 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 19:55:37,409 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-02 19:55:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 19:55:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-02-02 19:55:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 19:55:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-02-02 19:55:37,410 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 75 [2018-02-02 19:55:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:37,410 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-02-02 19:55:37,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:55:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-02-02 19:55:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 19:55:37,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:37,411 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-02 19:55:37,411 INFO L371 AbstractCegarLoop]: === Iteration 19 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -509747815, now seen corresponding path program 9 times [2018-02-02 19:55:37,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:37,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:37,543 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-02 19:55:37,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:37,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:37,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:37,543 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-02 19:55:37,543 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-02 19:55:37,544 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-02 19:55:37,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:55:37,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:55:37,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:55:37,544 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 15 states. [2018-02-02 19:55:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:37,650 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-02 19:55:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:55:37,650 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-02-02 19:55:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:37,650 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:55:37,650 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 19:55:37,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:55:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 19:55:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-02-02 19:55:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:55:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-02-02 19:55:37,652 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 81 [2018-02-02 19:55:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:37,652 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-02-02 19:55:37,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:55:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-02-02 19:55:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 19:55:37,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:37,653 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-02 19:55:37,653 INFO L371 AbstractCegarLoop]: === Iteration 20 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1909113093, now seen corresponding path program 10 times [2018-02-02 19:55:37,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:37,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:37,764 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-02 19:55:37,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:37,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:37,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:37,765 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-02 19:55:37,765 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-02 19:55:37,765 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-02 19:55:37,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:37,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:37,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:37,766 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 16 states. [2018-02-02 19:55:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:38,049 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-02-02 19:55:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:38,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-02-02 19:55:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:38,050 INFO L225 Difference]: With dead ends: 102 [2018-02-02 19:55:38,050 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 19:55:38,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:55:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 19:55:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-02-02 19:55:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:55:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-02-02 19:55:38,052 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 87 [2018-02-02 19:55:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:38,052 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-02-02 19:55:38,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-02-02 19:55:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 19:55:38,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:38,053 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-02 19:55:38,053 INFO L371 AbstractCegarLoop]: === Iteration 21 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash -834345383, now seen corresponding path program 11 times [2018-02-02 19:55:38,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:38,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:38,178 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-02 19:55:38,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:38,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:55:38,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:38,179 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-02 19:55:38,179 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-02 19:55:38,179 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-02 19:55:38,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:55:38,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:55:38,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:55:38,180 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 17 states. [2018-02-02 19:55:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:38,330 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 19:55:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:55:38,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-02 19:55:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:38,331 INFO L225 Difference]: With dead ends: 162 [2018-02-02 19:55:38,331 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:55:38,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:55:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:55:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-02-02 19:55:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 19:55:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2018-02-02 19:55:38,334 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 93 [2018-02-02 19:55:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:38,334 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2018-02-02 19:55:38,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:55:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2018-02-02 19:55:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 19:55:38,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:38,335 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-02 19:55:38,335 INFO L371 AbstractCegarLoop]: === Iteration 22 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:38,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1249642437, now seen corresponding path program 12 times [2018-02-02 19:55:38,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:38,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:38,517 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-02 19:55:38,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:38,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:55:38,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:38,517 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-02 19:55:38,517 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-02 19:55:38,518 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-02 19:55:38,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:55:38,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:55:38,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:55:38,518 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 18 states. [2018-02-02 19:55:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:38,831 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-02-02 19:55:38,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:55:38,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-02 19:55:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:38,831 INFO L225 Difference]: With dead ends: 114 [2018-02-02 19:55:38,831 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 19:55:38,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:55:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 19:55:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-02-02 19:55:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 19:55:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-02-02 19:55:38,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 99 [2018-02-02 19:55:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:38,834 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-02-02 19:55:38,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:55:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-02-02 19:55:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 19:55:38,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:38,835 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-02 19:55:38,835 INFO L371 AbstractCegarLoop]: === Iteration 23 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1058413849, now seen corresponding path program 13 times [2018-02-02 19:55:38,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:38,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:39,095 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-02 19:55:39,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:39,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:55:39,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:39,096 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-02 19:55:39,096 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-02 19:55:39,096 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-02 19:55:39,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:55:39,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:55:39,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:55:39,097 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 19 states. [2018-02-02 19:55:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:39,262 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2018-02-02 19:55:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:55:39,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2018-02-02 19:55:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:39,263 INFO L225 Difference]: With dead ends: 180 [2018-02-02 19:55:39,263 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 19:55:39,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:55:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 19:55:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-02-02 19:55:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:55:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-02-02 19:55:39,266 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 105 [2018-02-02 19:55:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:39,266 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-02-02 19:55:39,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:55:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-02-02 19:55:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 19:55:39,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:39,267 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-02 19:55:39,267 INFO L371 AbstractCegarLoop]: === Iteration 24 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1544913787, now seen corresponding path program 14 times [2018-02-02 19:55:39,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:39,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:39,445 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-02 19:55:39,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:39,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:55:39,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:39,445 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-02 19:55:39,445 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-02 19:55:39,446 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-02 19:55:39,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:55:39,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:55:39,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:55:39,446 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 20 states. [2018-02-02 19:55:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:39,790 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-02 19:55:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:55:39,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-02-02 19:55:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:39,791 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:55:39,791 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:55:39,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:55:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:55:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-02-02 19:55:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:55:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-02-02 19:55:39,793 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 111 [2018-02-02 19:55:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:39,793 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-02-02 19:55:39,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:55:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-02-02 19:55:39,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 19:55:39,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:39,794 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-02 19:55:39,794 INFO L371 AbstractCegarLoop]: === Iteration 25 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1300890073, now seen corresponding path program 15 times [2018-02-02 19:55:39,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:39,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:39,981 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-02 19:55:39,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:39,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 19:55:39,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:39,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-02 19:55:39,982 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-02 19:55:39,983 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-02 19:55:39,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:55:39,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:55:39,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:55:39,983 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 21 states. [2018-02-02 19:55:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:40,133 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-02 19:55:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:55:40,134 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-02-02 19:55:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:40,134 INFO L225 Difference]: With dead ends: 198 [2018-02-02 19:55:40,134 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:55:40,135 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-02 19:55:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:55:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2018-02-02 19:55:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:55:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-02-02 19:55:40,136 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 117 [2018-02-02 19:55:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:40,136 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-02-02 19:55:40,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:55:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-02-02 19:55:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 19:55:40,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:40,137 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-02 19:55:40,137 INFO L371 AbstractCegarLoop]: === Iteration 26 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1393467205, now seen corresponding path program 16 times [2018-02-02 19:55:40,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:40,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:40,367 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-02 19:55:40,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:40,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 19:55:40,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:40,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-02 19:55:40,368 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-02 19:55:40,368 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-02 19:55:40,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:55:40,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:55:40,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:55:40,369 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 22 states. [2018-02-02 19:55:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:40,815 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-02-02 19:55:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:55:40,815 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2018-02-02 19:55:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:40,816 INFO L225 Difference]: With dead ends: 138 [2018-02-02 19:55:40,816 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 19:55:40,816 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-02 19:55:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 19:55:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-02-02 19:55:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 19:55:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2018-02-02 19:55:40,818 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 123 [2018-02-02 19:55:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:40,818 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2018-02-02 19:55:40,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:55:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2018-02-02 19:55:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 19:55:40,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:40,818 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-02 19:55:40,818 INFO L371 AbstractCegarLoop]: === Iteration 27 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1379472537, now seen corresponding path program 17 times [2018-02-02 19:55:40,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:40,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:41,009 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-02 19:55:41,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:41,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:55:41,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:41,010 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-02 19:55:41,010 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-02 19:55:41,010 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-02 19:55:41,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 19:55:41,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 19:55:41,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:55:41,011 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand 23 states. [2018-02-02 19:55:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:41,192 INFO L93 Difference]: Finished difference Result 216 states and 250 transitions. [2018-02-02 19:55:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 19:55:41,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-02-02 19:55:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:41,193 INFO L225 Difference]: With dead ends: 216 [2018-02-02 19:55:41,193 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 19:55:41,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:55:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 19:55:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-02 19:55:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 19:55:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-02-02 19:55:41,195 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 129 [2018-02-02 19:55:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:41,195 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-02-02 19:55:41,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 19:55:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2018-02-02 19:55:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-02 19:55:41,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:41,195 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-02 19:55:41,195 INFO L371 AbstractCegarLoop]: === Iteration 28 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash 738258949, now seen corresponding path program 18 times [2018-02-02 19:55:41,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:41,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:41,427 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-02 19:55:41,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:41,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:55:41,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:41,428 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-02 19:55:41,428 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-02 19:55:41,428 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-02 19:55:41,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:55:41,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:55:41,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:55:41,429 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 24 states. [2018-02-02 19:55:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:41,858 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2018-02-02 19:55:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:55:41,858 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-02-02 19:55:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:41,859 INFO L225 Difference]: With dead ends: 150 [2018-02-02 19:55:41,859 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:55:41,859 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-02 19:55:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:55:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-02-02 19:55:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 19:55:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-02-02 19:55:41,861 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 135 [2018-02-02 19:55:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:41,861 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-02-02 19:55:41,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:55:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-02-02 19:55:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 19:55:41,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:41,862 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-02 19:55:41,862 INFO L371 AbstractCegarLoop]: === Iteration 29 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash -858008231, now seen corresponding path program 19 times [2018-02-02 19:55:41,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:41,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:42,153 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-02 19:55:42,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:42,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:55:42,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:42,154 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-02 19:55:42,154 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-02 19:55:42,155 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-02 19:55:42,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:55:42,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:55:42,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:55:42,155 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 25 states. [2018-02-02 19:55:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:42,423 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-02 19:55:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:55:42,423 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-02-02 19:55:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:42,424 INFO L225 Difference]: With dead ends: 234 [2018-02-02 19:55:42,424 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 19:55:42,424 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-02 19:55:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 19:55:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2018-02-02 19:55:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:55:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2018-02-02 19:55:42,428 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 141 [2018-02-02 19:55:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:42,428 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2018-02-02 19:55:42,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:55:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2018-02-02 19:55:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 19:55:42,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:42,428 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-02 19:55:42,428 INFO L371 AbstractCegarLoop]: === Iteration 30 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -369496379, now seen corresponding path program 20 times [2018-02-02 19:55:42,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:42,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:42,783 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-02 19:55:42,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:42,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:55:42,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:42,784 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-02 19:55:42,784 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-02 19:55:42,784 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-02 19:55:42,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:55:42,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:55:42,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:55:42,785 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand 26 states. [2018-02-02 19:55:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:43,400 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 19:55:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:55:43,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2018-02-02 19:55:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:43,402 INFO L225 Difference]: With dead ends: 162 [2018-02-02 19:55:43,402 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 19:55:43,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:55:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 19:55:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-02-02 19:55:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 19:55:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2018-02-02 19:55:43,404 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 147 [2018-02-02 19:55:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:43,405 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2018-02-02 19:55:43,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:55:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2018-02-02 19:55:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-02 19:55:43,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:43,406 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-02 19:55:43,406 INFO L371 AbstractCegarLoop]: === Iteration 31 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1279968281, now seen corresponding path program 21 times [2018-02-02 19:55:43,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:43,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:43,750 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-02 19:55:43,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:43,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:55:43,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:43,751 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-02 19:55:43,751 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-02 19:55:43,752 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-02 19:55:43,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:55:43,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:55:43,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:55:43,752 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand 27 states. [2018-02-02 19:55:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:43,976 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2018-02-02 19:55:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:55:43,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2018-02-02 19:55:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:43,977 INFO L225 Difference]: With dead ends: 252 [2018-02-02 19:55:43,977 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 19:55:43,977 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-02 19:55:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 19:55:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 19:55:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 19:55:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2018-02-02 19:55:43,979 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 153 [2018-02-02 19:55:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:43,979 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2018-02-02 19:55:43,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:55:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2018-02-02 19:55:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 19:55:43,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:43,980 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-02 19:55:43,980 INFO L371 AbstractCegarLoop]: === Iteration 32 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 391256965, now seen corresponding path program 22 times [2018-02-02 19:55:43,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:44,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:44,286 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-02 19:55:44,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:44,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:55:44,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:44,287 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-02 19:55:44,287 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-02 19:55:44,287 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-02 19:55:44,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:55:44,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:55:44,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:55:44,288 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand 28 states. [2018-02-02 19:55:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:45,032 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2018-02-02 19:55:45,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:55:45,032 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 159 [2018-02-02 19:55:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:45,033 INFO L225 Difference]: With dead ends: 174 [2018-02-02 19:55:45,033 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 19:55:45,033 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-02 19:55:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 19:55:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-02-02 19:55:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 19:55:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2018-02-02 19:55:45,036 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 159 [2018-02-02 19:55:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:45,037 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2018-02-02 19:55:45,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:55:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2018-02-02 19:55:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 19:55:45,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:45,038 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-02 19:55:45,038 INFO L371 AbstractCegarLoop]: === Iteration 33 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1451122905, now seen corresponding path program 23 times [2018-02-02 19:55:45,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:45,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:45,386 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-02 19:55:45,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:45,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:55:45,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:45,387 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-02 19:55:45,387 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-02 19:55:45,387 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-02 19:55:45,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 19:55:45,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 19:55:45,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:55:45,388 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand 29 states. [2018-02-02 19:55:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:45,641 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-02 19:55:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 19:55:45,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 165 [2018-02-02 19:55:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:45,642 INFO L225 Difference]: With dead ends: 270 [2018-02-02 19:55:45,642 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 19:55:45,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:55:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 19:55:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 183. [2018-02-02 19:55:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 19:55:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-02-02 19:55:45,644 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 165 [2018-02-02 19:55:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:45,644 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-02-02 19:55:45,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 19:55:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-02-02 19:55:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 19:55:45,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:45,645 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-02 19:55:45,645 INFO L371 AbstractCegarLoop]: === Iteration 34 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash -176032187, now seen corresponding path program 24 times [2018-02-02 19:55:45,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:45,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:45,991 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-02 19:55:45,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:45,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:55:45,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:45,993 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-02 19:55:45,993 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-02 19:55:45,994 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-02 19:55:45,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:55:45,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:55:45,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:55:45,994 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 30 states. [2018-02-02 19:55:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:46,701 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2018-02-02 19:55:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:55:46,702 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 171 [2018-02-02 19:55:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:46,702 INFO L225 Difference]: With dead ends: 186 [2018-02-02 19:55:46,702 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 19:55:46,703 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-02 19:55:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 19:55:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-02-02 19:55:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 19:55:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2018-02-02 19:55:46,704 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 171 [2018-02-02 19:55:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:46,704 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2018-02-02 19:55:46,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:55:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2018-02-02 19:55:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 19:55:46,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:46,705 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-02 19:55:46,705 INFO L371 AbstractCegarLoop]: === Iteration 35 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1351560089, now seen corresponding path program 25 times [2018-02-02 19:55:46,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:46,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:47,086 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-02 19:55:47,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:47,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 19:55:47,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:47,086 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-02 19:55:47,086 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-02 19:55:47,087 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-02 19:55:47,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:55:47,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:55:47,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:55:47,087 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 31 states. [2018-02-02 19:55:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:47,308 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2018-02-02 19:55:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:55:47,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 177 [2018-02-02 19:55:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:47,309 INFO L225 Difference]: With dead ends: 288 [2018-02-02 19:55:47,309 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 19:55:47,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:55:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 19:55:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 195. [2018-02-02 19:55:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 19:55:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2018-02-02 19:55:47,311 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 177 [2018-02-02 19:55:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:47,312 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2018-02-02 19:55:47,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:55:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2018-02-02 19:55:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 19:55:47,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:47,312 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-02 19:55:47,312 INFO L371 AbstractCegarLoop]: === Iteration 36 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1696726789, now seen corresponding path program 26 times [2018-02-02 19:55:47,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:47,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:47,793 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-02 19:55:47,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:47,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 19:55:47,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:47,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-02 19:55:47,794 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-02 19:55:47,794 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-02 19:55:47,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:55:47,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:55:47,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:55:47,795 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand 32 states. [2018-02-02 19:55:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:48,715 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-02 19:55:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:55:48,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-02-02 19:55:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:48,717 INFO L225 Difference]: With dead ends: 198 [2018-02-02 19:55:48,717 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 19:55:48,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=524, Invalid=1828, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:55:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 19:55:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-02-02 19:55:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 19:55:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 226 transitions. [2018-02-02 19:55:48,719 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 226 transitions. Word has length 183 [2018-02-02 19:55:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:48,719 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 226 transitions. [2018-02-02 19:55:48,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:55:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 226 transitions. [2018-02-02 19:55:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-02 19:55:48,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:48,720 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-02 19:55:48,720 INFO L371 AbstractCegarLoop]: === Iteration 37 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1723180121, now seen corresponding path program 27 times [2018-02-02 19:55:48,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:48,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:49,062 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-02 19:55:49,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:49,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 19:55:49,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:49,063 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-02 19:55:49,063 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-02 19:55:49,063 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-02 19:55:49,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:55:49,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:55:49,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:55:49,064 INFO L87 Difference]: Start difference. First operand 195 states and 226 transitions. Second operand 33 states. [2018-02-02 19:55:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:49,494 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-02 19:55:49,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:55:49,494 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 189 [2018-02-02 19:55:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:49,494 INFO L225 Difference]: With dead ends: 306 [2018-02-02 19:55:49,495 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 19:55:49,495 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-02 19:55:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 19:55:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2018-02-02 19:55:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 19:55:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-02-02 19:55:49,496 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 189 [2018-02-02 19:55:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:49,497 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-02-02 19:55:49,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:55:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-02-02 19:55:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 19:55:49,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:49,497 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-02 19:55:49,497 INFO L371 AbstractCegarLoop]: === Iteration 38 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash -840256059, now seen corresponding path program 28 times [2018-02-02 19:55:49,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:49,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:49,921 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-02 19:55:49,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:49,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 19:55:49,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:49,922 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-02 19:55:49,922 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-02 19:55:49,922 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-02 19:55:49,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:55:49,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:55:49,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:55:49,923 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 34 states. [2018-02-02 19:55:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:50,613 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2018-02-02 19:55:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:55:50,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 195 [2018-02-02 19:55:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:50,614 INFO L225 Difference]: With dead ends: 210 [2018-02-02 19:55:50,614 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 19:55:50,615 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-02 19:55:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 19:55:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-02-02 19:55:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 19:55:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 240 transitions. [2018-02-02 19:55:50,616 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 240 transitions. Word has length 195 [2018-02-02 19:55:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:50,617 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 240 transitions. [2018-02-02 19:55:50,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:55:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 240 transitions. [2018-02-02 19:55:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-02 19:55:50,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:50,617 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-02 19:55:50,617 INFO L371 AbstractCegarLoop]: === Iteration 39 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1951025945, now seen corresponding path program 29 times [2018-02-02 19:55:50,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:50,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:51,027 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-02 19:55:51,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:51,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 19:55:51,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:51,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-02 19:55:51,028 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-02 19:55:51,028 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-02 19:55:51,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:55:51,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:55:51,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:55:51,029 INFO L87 Difference]: Start difference. First operand 207 states and 240 transitions. Second operand 35 states. [2018-02-02 19:55:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:51,370 INFO L93 Difference]: Finished difference Result 324 states and 376 transitions. [2018-02-02 19:55:51,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 19:55:51,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 201 [2018-02-02 19:55:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:51,371 INFO L225 Difference]: With dead ends: 324 [2018-02-02 19:55:51,371 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 19:55:51,371 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-02 19:55:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 19:55:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-02 19:55:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 19:55:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2018-02-02 19:55:51,373 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 201 [2018-02-02 19:55:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:51,373 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2018-02-02 19:55:51,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:55:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2018-02-02 19:55:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 19:55:51,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:51,374 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-02 19:55:51,374 INFO L371 AbstractCegarLoop]: === Iteration 40 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash 112499333, now seen corresponding path program 30 times [2018-02-02 19:55:51,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:51,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:51,965 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-02 19:55:51,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:51,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 19:55:51,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:51,965 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-02 19:55:51,965 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-02 19:55:51,965 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-02 19:55:51,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:55:51,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:55:51,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:55:51,966 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 36 states. [2018-02-02 19:55:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:52,978 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2018-02-02 19:55:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 19:55:53,004 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-02-02 19:55:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:53,005 INFO L225 Difference]: With dead ends: 222 [2018-02-02 19:55:53,005 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 19:55:53,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=660, Invalid=2310, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:55:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 19:55:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2018-02-02 19:55:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 19:55:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-02-02 19:55:53,008 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 207 [2018-02-02 19:55:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:53,009 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-02-02 19:55:53,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:55:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-02-02 19:55:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 19:55:53,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:53,010 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-02 19:55:53,010 INFO L371 AbstractCegarLoop]: === Iteration 41 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -339370023, now seen corresponding path program 31 times [2018-02-02 19:55:53,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:53,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:53,423 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-02 19:55:53,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:53,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 19:55:53,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:53,424 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-02 19:55:53,424 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-02 19:55:53,424 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-02 19:55:53,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:55:53,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:55:53,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:55:53,425 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand 37 states. [2018-02-02 19:55:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:53,757 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-02 19:55:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 19:55:53,757 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 213 [2018-02-02 19:55:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:53,758 INFO L225 Difference]: With dead ends: 342 [2018-02-02 19:55:53,758 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 19:55:53,759 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-02 19:55:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 19:55:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2018-02-02 19:55:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 19:55:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-02 19:55:53,761 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 213 [2018-02-02 19:55:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:53,761 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-02 19:55:53,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:55:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-02 19:55:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-02 19:55:53,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:53,762 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-02 19:55:53,762 INFO L371 AbstractCegarLoop]: === Iteration 42 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1031286085, now seen corresponding path program 32 times [2018-02-02 19:55:53,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:53,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:54,342 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-02 19:55:54,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:54,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 19:55:54,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:54,343 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-02 19:55:54,343 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-02 19:55:54,343 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-02 19:55:54,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 19:55:54,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 19:55:54,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1090, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:55:54,344 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 38 states. [2018-02-02 19:55:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:55,475 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-02 19:55:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:55:55,475 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2018-02-02 19:55:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:55,476 INFO L225 Difference]: With dead ends: 234 [2018-02-02 19:55:55,476 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 19:55:55,476 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-02 19:55:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 19:55:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-02-02 19:55:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 19:55:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-02 19:55:55,478 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 219 [2018-02-02 19:55:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:55,478 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-02 19:55:55,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 19:55:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-02 19:55:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-02 19:55:55,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:55,479 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-02 19:55:55,479 INFO L371 AbstractCegarLoop]: === Iteration 43 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1094704487, now seen corresponding path program 33 times [2018-02-02 19:55:55,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:55,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:55,959 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-02 19:55:55,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:55,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 19:55:55,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:55,959 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-02 19:55:55,959 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-02 19:55:55,960 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-02 19:55:55,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:55:55,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:55:55,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 19:55:55,961 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 39 states. [2018-02-02 19:55:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:56,374 INFO L93 Difference]: Finished difference Result 360 states and 418 transitions. [2018-02-02 19:55:56,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 19:55:56,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 225 [2018-02-02 19:55:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:56,375 INFO L225 Difference]: With dead ends: 360 [2018-02-02 19:55:56,375 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 19:55:56,375 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-02 19:55:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 19:55:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-02-02 19:55:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 19:55:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 283 transitions. [2018-02-02 19:55:56,378 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 283 transitions. Word has length 225 [2018-02-02 19:55:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:56,378 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 283 transitions. [2018-02-02 19:55:56,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:55:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 283 transitions. [2018-02-02 19:55:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-02-02 19:55:56,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:56,379 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-02 19:55:56,380 INFO L371 AbstractCegarLoop]: === Iteration 44 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash -548540923, now seen corresponding path program 34 times [2018-02-02 19:55:56,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:56,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:56,954 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-02 19:55:56,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:56,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 19:55:56,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:56,955 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-02 19:55:56,955 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-02 19:55:56,955 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-02 19:55:56,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 19:55:56,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 19:55:56,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:55:56,956 INFO L87 Difference]: Start difference. First operand 243 states and 283 transitions. Second operand 40 states. [2018-02-02 19:55:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:58,284 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2018-02-02 19:55:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 19:55:58,284 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 231 [2018-02-02 19:55:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:58,285 INFO L225 Difference]: With dead ends: 246 [2018-02-02 19:55:58,285 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 19:55:58,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 19:55:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 19:55:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-02-02 19:55:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 19:55:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 282 transitions. [2018-02-02 19:55:58,287 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 282 transitions. Word has length 231 [2018-02-02 19:55:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:58,288 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 282 transitions. [2018-02-02 19:55:58,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 19:55:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 282 transitions. [2018-02-02 19:55:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 19:55:58,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:58,288 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-02 19:55:58,288 INFO L371 AbstractCegarLoop]: === Iteration 45 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1173508953, now seen corresponding path program 35 times [2018-02-02 19:55:58,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:58,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:58,754 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-02 19:55:58,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:58,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:55:58,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:58,754 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-02 19:55:58,754 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-02 19:55:58,755 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-02 19:55:58,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:55:58,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:55:58,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:55:58,755 INFO L87 Difference]: Start difference. First operand 243 states and 282 transitions. Second operand 41 states. [2018-02-02 19:55:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:59,160 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-02 19:55:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 19:55:59,160 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-02-02 19:55:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:59,161 INFO L225 Difference]: With dead ends: 378 [2018-02-02 19:55:59,161 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 19:55:59,162 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-02 19:55:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 19:55:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 255. [2018-02-02 19:55:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 19:55:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 297 transitions. [2018-02-02 19:55:59,163 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 297 transitions. Word has length 237 [2018-02-02 19:55:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:59,163 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 297 transitions. [2018-02-02 19:55:59,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:55:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 297 transitions. [2018-02-02 19:55:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-02 19:55:59,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:59,164 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-02 19:55:59,164 INFO L371 AbstractCegarLoop]: === Iteration 46 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:55:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2140250939, now seen corresponding path program 36 times [2018-02-02 19:55:59,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:59,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:59,757 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-02 19:55:59,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:59,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:55:59,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:59,757 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-02 19:55:59,757 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-02 19:55:59,758 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-02 19:55:59,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:55:59,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:55:59,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:55:59,758 INFO L87 Difference]: Start difference. First operand 255 states and 297 transitions. Second operand 42 states. [2018-02-02 19:56:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:01,094 INFO L93 Difference]: Finished difference Result 258 states and 299 transitions. [2018-02-02 19:56:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 19:56:01,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 243 [2018-02-02 19:56:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:01,095 INFO L225 Difference]: With dead ends: 258 [2018-02-02 19:56:01,095 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 19:56:01,096 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-02 19:56:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 19:56:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-02-02 19:56:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 19:56:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-02-02 19:56:01,097 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 243 [2018-02-02 19:56:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:01,098 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-02-02 19:56:01,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:56:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-02-02 19:56:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-02 19:56:01,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:01,099 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-02 19:56:01,099 INFO L371 AbstractCegarLoop]: === Iteration 47 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 691319321, now seen corresponding path program 37 times [2018-02-02 19:56:01,100 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:01,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:01,800 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-02 19:56:01,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:01,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 19:56:01,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:01,800 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-02 19:56:01,800 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-02 19:56:01,801 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-02 19:56:01,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 19:56:01,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 19:56:01,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:56:01,801 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 43 states. [2018-02-02 19:56:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:02,338 INFO L93 Difference]: Finished difference Result 396 states and 460 transitions. [2018-02-02 19:56:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 19:56:02,339 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-02 19:56:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:02,340 INFO L225 Difference]: With dead ends: 396 [2018-02-02 19:56:02,340 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 19:56:02,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=944, Invalid=2962, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 19:56:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 19:56:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-02-02 19:56:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 19:56:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2018-02-02 19:56:02,344 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 249 [2018-02-02 19:56:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:02,344 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2018-02-02 19:56:02,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 19:56:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2018-02-02 19:56:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-02 19:56:02,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:02,345 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-02 19:56:02,346 INFO L371 AbstractCegarLoop]: === Iteration 48 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1003357819, now seen corresponding path program 38 times [2018-02-02 19:56:02,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:02,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:03,081 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-02 19:56:03,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:03,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 19:56:03,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:03,081 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-02 19:56:03,081 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-02 19:56:03,081 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-02 19:56:03,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 19:56:03,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 19:56:03,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:56:03,082 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand 44 states. [2018-02-02 19:56:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:04,617 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-02 19:56:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 19:56:04,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2018-02-02 19:56:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:04,618 INFO L225 Difference]: With dead ends: 270 [2018-02-02 19:56:04,618 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 19:56:04,618 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-02 19:56:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 19:56:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-02-02 19:56:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 19:56:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions. [2018-02-02 19:56:04,620 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 255 [2018-02-02 19:56:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:04,621 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 310 transitions. [2018-02-02 19:56:04,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 19:56:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions. [2018-02-02 19:56:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-02-02 19:56:04,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:04,621 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-02 19:56:04,621 INFO L371 AbstractCegarLoop]: === Iteration 49 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1199554265, now seen corresponding path program 39 times [2018-02-02 19:56:04,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:04,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:05,310 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-02 19:56:05,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:05,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 19:56:05,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:05,311 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-02 19:56:05,311 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-02 19:56:05,311 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-02 19:56:05,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 19:56:05,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 19:56:05,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=1492, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:56:05,312 INFO L87 Difference]: Start difference. First operand 267 states and 310 transitions. Second operand 45 states. [2018-02-02 19:56:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:05,787 INFO L93 Difference]: Finished difference Result 414 states and 481 transitions. [2018-02-02 19:56:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 19:56:05,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 261 [2018-02-02 19:56:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:05,788 INFO L225 Difference]: With dead ends: 414 [2018-02-02 19:56:05,788 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 19:56:05,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 19:56:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 19:56:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2018-02-02 19:56:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 19:56:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 325 transitions. [2018-02-02 19:56:05,791 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 325 transitions. Word has length 261 [2018-02-02 19:56:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:05,791 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 325 transitions. [2018-02-02 19:56:05,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 19:56:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 325 transitions. [2018-02-02 19:56:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-02 19:56:05,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:05,792 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-02 19:56:05,792 INFO L371 AbstractCegarLoop]: === Iteration 50 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1158759493, now seen corresponding path program 40 times [2018-02-02 19:56:05,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:05,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:06,544 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-02 19:56:06,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:06,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 19:56:06,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:06,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-02 19:56:06,544 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-02 19:56:06,545 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-02 19:56:06,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 19:56:06,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 19:56:06,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:56:06,545 INFO L87 Difference]: Start difference. First operand 279 states and 325 transitions. Second operand 46 states. [2018-02-02 19:56:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:08,161 INFO L93 Difference]: Finished difference Result 282 states and 327 transitions. [2018-02-02 19:56:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 19:56:08,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 267 [2018-02-02 19:56:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:08,162 INFO L225 Difference]: With dead ends: 282 [2018-02-02 19:56:08,162 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 19:56:08,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1070, Invalid=3760, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 19:56:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 19:56:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2018-02-02 19:56:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 19:56:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2018-02-02 19:56:08,164 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 267 [2018-02-02 19:56:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:08,165 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2018-02-02 19:56:08,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 19:56:08,165 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2018-02-02 19:56:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-02 19:56:08,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:08,166 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-02 19:56:08,166 INFO L371 AbstractCegarLoop]: === Iteration 51 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1628702311, now seen corresponding path program 41 times [2018-02-02 19:56:08,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:08,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:08,848 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-02 19:56:08,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:08,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 19:56:08,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:08,848 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-02 19:56:08,848 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-02 19:56:08,849 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-02 19:56:08,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 19:56:08,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 19:56:08,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 19:56:08,849 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand 47 states. [2018-02-02 19:56:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:09,495 INFO L93 Difference]: Finished difference Result 432 states and 502 transitions. [2018-02-02 19:56:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 19:56:09,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 273 [2018-02-02 19:56:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:09,496 INFO L225 Difference]: With dead ends: 432 [2018-02-02 19:56:09,496 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 19:56:09,496 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-02 19:56:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 19:56:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-02 19:56:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 19:56:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 339 transitions. [2018-02-02 19:56:09,498 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 339 transitions. Word has length 273 [2018-02-02 19:56:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:09,499 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 339 transitions. [2018-02-02 19:56:09,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 19:56:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 339 transitions. [2018-02-02 19:56:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-02 19:56:09,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:09,500 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-02 19:56:09,500 INFO L371 AbstractCegarLoop]: === Iteration 52 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2091171077, now seen corresponding path program 42 times [2018-02-02 19:56:09,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:09,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:10,256 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-02 19:56:10,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:10,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 19:56:10,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:10,257 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-02 19:56:10,257 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-02 19:56:10,257 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-02 19:56:10,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 19:56:10,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 19:56:10,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=1740, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 19:56:10,258 INFO L87 Difference]: Start difference. First operand 291 states and 339 transitions. Second operand 48 states. [2018-02-02 19:56:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:12,076 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2018-02-02 19:56:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 19:56:12,076 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 279 [2018-02-02 19:56:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:12,077 INFO L225 Difference]: With dead ends: 294 [2018-02-02 19:56:12,077 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 19:56:12,077 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-02 19:56:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 19:56:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-02-02 19:56:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 19:56:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-02-02 19:56:12,079 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 279 [2018-02-02 19:56:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:12,080 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-02-02 19:56:12,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 19:56:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-02-02 19:56:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-02 19:56:12,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:12,081 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-02 19:56:12,081 INFO L371 AbstractCegarLoop]: === Iteration 53 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash 884073049, now seen corresponding path program 43 times [2018-02-02 19:56:12,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:12,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:12,799 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-02 19:56:12,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:12,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 19:56:12,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:12,799 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-02 19:56:12,799 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-02 19:56:12,800 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-02 19:56:12,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 19:56:12,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 19:56:12,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:56:12,800 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 49 states. [2018-02-02 19:56:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:13,320 INFO L93 Difference]: Finished difference Result 450 states and 523 transitions. [2018-02-02 19:56:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 19:56:13,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 285 [2018-02-02 19:56:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:13,321 INFO L225 Difference]: With dead ends: 450 [2018-02-02 19:56:13,321 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 19:56:13,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1223, Invalid=3889, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 19:56:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 19:56:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2018-02-02 19:56:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 19:56:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 353 transitions. [2018-02-02 19:56:13,324 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 353 transitions. Word has length 285 [2018-02-02 19:56:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:13,324 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 353 transitions. [2018-02-02 19:56:13,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 19:56:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 353 transitions. [2018-02-02 19:56:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-02-02 19:56:13,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:13,325 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-02 19:56:13,325 INFO L371 AbstractCegarLoop]: === Iteration 54 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1415257147, now seen corresponding path program 44 times [2018-02-02 19:56:13,326 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:13,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:14,165 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-02 19:56:14,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:14,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 19:56:14,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:14,165 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-02 19:56:14,166 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-02 19:56:14,166 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-02 19:56:14,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 19:56:14,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 19:56:14,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=1888, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 19:56:14,166 INFO L87 Difference]: Start difference. First operand 303 states and 353 transitions. Second operand 50 states. [2018-02-02 19:56:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:16,237 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-02 19:56:16,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 19:56:16,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2018-02-02 19:56:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:16,238 INFO L225 Difference]: With dead ends: 306 [2018-02-02 19:56:16,238 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 19:56:16,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1262, Invalid=4438, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 19:56:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 19:56:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2018-02-02 19:56:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 19:56:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2018-02-02 19:56:16,240 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 291 [2018-02-02 19:56:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:16,240 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2018-02-02 19:56:16,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 19:56:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2018-02-02 19:56:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-02 19:56:16,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:16,241 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-02 19:56:16,241 INFO L371 AbstractCegarLoop]: === Iteration 55 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -47580903, now seen corresponding path program 45 times [2018-02-02 19:56:16,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:16,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:17,026 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-02 19:56:17,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:17,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 19:56:17,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:17,027 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-02 19:56:17,027 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-02 19:56:17,028 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-02 19:56:17,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 19:56:17,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 19:56:17,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1921, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 19:56:17,028 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand 51 states. [2018-02-02 19:56:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:17,684 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-02-02 19:56:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 19:56:17,684 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 297 [2018-02-02 19:56:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:17,685 INFO L225 Difference]: With dead ends: 468 [2018-02-02 19:56:17,685 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 19:56:17,685 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-02 19:56:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 19:56:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2018-02-02 19:56:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 19:56:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 367 transitions. [2018-02-02 19:56:17,687 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 367 transitions. Word has length 297 [2018-02-02 19:56:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:17,687 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 367 transitions. [2018-02-02 19:56:17,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 19:56:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 367 transitions. [2018-02-02 19:56:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-02 19:56:17,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:17,688 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-02 19:56:17,688 INFO L371 AbstractCegarLoop]: === Iteration 56 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:17,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1041614715, now seen corresponding path program 46 times [2018-02-02 19:56:17,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:17,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:18,612 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-02 19:56:18,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:18,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 19:56:18,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:18,613 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-02 19:56:18,613 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-02 19:56:18,613 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-02 19:56:18,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 19:56:18,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 19:56:18,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=2042, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 19:56:18,614 INFO L87 Difference]: Start difference. First operand 315 states and 367 transitions. Second operand 52 states. [2018-02-02 19:56:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:20,820 INFO L93 Difference]: Finished difference Result 318 states and 369 transitions. [2018-02-02 19:56:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 19:56:20,820 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 303 [2018-02-02 19:56:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:20,821 INFO L225 Difference]: With dead ends: 318 [2018-02-02 19:56:20,821 INFO L226 Difference]: Without dead ends: 318 [2018-02-02 19:56:20,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=4798, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 19:56:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-02 19:56:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2018-02-02 19:56:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 19:56:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 366 transitions. [2018-02-02 19:56:20,823 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 366 transitions. Word has length 303 [2018-02-02 19:56:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:20,823 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 366 transitions. [2018-02-02 19:56:20,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 19:56:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 366 transitions. [2018-02-02 19:56:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-02-02 19:56:20,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:20,824 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-02 19:56:20,824 INFO L371 AbstractCegarLoop]: === Iteration 57 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1009992231, now seen corresponding path program 47 times [2018-02-02 19:56:20,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:20,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:21,646 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-02 19:56:21,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:21,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 19:56:21,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:21,646 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-02 19:56:21,646 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-02 19:56:21,647 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-02 19:56:21,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 19:56:21,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 19:56:21,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=2076, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 19:56:21,647 INFO L87 Difference]: Start difference. First operand 315 states and 366 transitions. Second operand 53 states. [2018-02-02 19:56:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:22,414 INFO L93 Difference]: Finished difference Result 486 states and 565 transitions. [2018-02-02 19:56:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 19:56:22,414 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 309 [2018-02-02 19:56:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:22,415 INFO L225 Difference]: With dead ends: 486 [2018-02-02 19:56:22,415 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 19:56:22,416 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-02 19:56:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 19:56:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 327. [2018-02-02 19:56:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 19:56:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 381 transitions. [2018-02-02 19:56:22,417 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 381 transitions. Word has length 309 [2018-02-02 19:56:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:22,418 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 381 transitions. [2018-02-02 19:56:22,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 19:56:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 381 transitions. [2018-02-02 19:56:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-02-02 19:56:22,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:22,419 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-02 19:56:22,419 INFO L371 AbstractCegarLoop]: === Iteration 58 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1181563717, now seen corresponding path program 48 times [2018-02-02 19:56:22,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:22,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:23,378 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-02 19:56:23,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:23,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 19:56:23,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:23,379 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-02 19:56:23,379 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-02 19:56:23,379 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-02 19:56:23,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 19:56:23,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 19:56:23,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 19:56:23,380 INFO L87 Difference]: Start difference. First operand 327 states and 381 transitions. Second operand 54 states. [2018-02-02 19:56:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:25,616 INFO L93 Difference]: Finished difference Result 330 states and 383 transitions. [2018-02-02 19:56:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 19:56:25,616 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2018-02-02 19:56:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:25,617 INFO L225 Difference]: With dead ends: 330 [2018-02-02 19:56:25,617 INFO L226 Difference]: Without dead ends: 330 [2018-02-02 19:56:25,617 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-02 19:56:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-02 19:56:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2018-02-02 19:56:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 19:56:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 380 transitions. [2018-02-02 19:56:25,619 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 380 transitions. Word has length 315 [2018-02-02 19:56:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:25,619 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 380 transitions. [2018-02-02 19:56:25,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 19:56:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 380 transitions. [2018-02-02 19:56:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-02 19:56:25,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:25,620 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-02 19:56:25,620 INFO L371 AbstractCegarLoop]: === Iteration 59 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash 322089113, now seen corresponding path program 49 times [2018-02-02 19:56:25,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:25,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:26,501 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-02 19:56:26,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:26,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 19:56:26,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:26,502 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-02 19:56:26,502 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-02 19:56:26,502 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-02 19:56:26,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 19:56:26,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 19:56:26,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=2237, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:56:26,503 INFO L87 Difference]: Start difference. First operand 327 states and 380 transitions. Second operand 55 states. [2018-02-02 19:56:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:27,292 INFO L93 Difference]: Finished difference Result 504 states and 586 transitions. [2018-02-02 19:56:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 19:56:27,292 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 321 [2018-02-02 19:56:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:27,293 INFO L225 Difference]: With dead ends: 504 [2018-02-02 19:56:27,293 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 19:56:27,294 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-02 19:56:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 19:56:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2018-02-02 19:56:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 19:56:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 395 transitions. [2018-02-02 19:56:27,296 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 395 transitions. Word has length 321 [2018-02-02 19:56:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:27,296 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 395 transitions. [2018-02-02 19:56:27,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 19:56:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 395 transitions. [2018-02-02 19:56:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-02 19:56:27,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:27,297 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-02 19:56:27,297 INFO L371 AbstractCegarLoop]: === Iteration 60 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1061579781, now seen corresponding path program 50 times [2018-02-02 19:56:27,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:27,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:28,367 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-02 19:56:28,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:28,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 19:56:28,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56: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-02 19:56:28,368 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-02 19:56:28,368 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-02 19:56:28,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 19:56:28,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 19:56:28,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 19:56:28,369 INFO L87 Difference]: Start difference. First operand 339 states and 395 transitions. Second operand 56 states. [2018-02-02 19:56:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:30,918 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-02 19:56:30,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 19:56:30,918 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2018-02-02 19:56:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:30,919 INFO L225 Difference]: With dead ends: 342 [2018-02-02 19:56:30,919 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 19:56:30,919 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-02 19:56:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 19:56:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 339. [2018-02-02 19:56:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 19:56:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 394 transitions. [2018-02-02 19:56:30,921 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 394 transitions. Word has length 327 [2018-02-02 19:56:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:30,921 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 394 transitions. [2018-02-02 19:56:30,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 19:56:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 394 transitions. [2018-02-02 19:56:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-02 19:56:30,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:30,922 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-02 19:56:30,922 INFO L371 AbstractCegarLoop]: === Iteration 61 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:30,922 INFO L82 PathProgramCache]: Analyzing trace with hash 487870809, now seen corresponding path program 51 times [2018-02-02 19:56:30,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:30,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:31,878 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-02 19:56:31,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:31,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 19:56:31,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:31,879 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-02 19:56:31,879 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-02 19:56:31,880 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-02 19:56:31,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-02 19:56:31,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-02 19:56:31,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=788, Invalid=2404, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 19:56:31,881 INFO L87 Difference]: Start difference. First operand 339 states and 394 transitions. Second operand 57 states. [2018-02-02 19:56:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:32,718 INFO L93 Difference]: Finished difference Result 522 states and 607 transitions. [2018-02-02 19:56:32,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 19:56:32,718 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 333 [2018-02-02 19:56:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:32,719 INFO L225 Difference]: With dead ends: 522 [2018-02-02 19:56:32,719 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 19:56:32,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1651, Invalid=5321, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 19:56:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 19:56:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 351. [2018-02-02 19:56:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 19:56:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 409 transitions. [2018-02-02 19:56:32,721 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 409 transitions. Word has length 333 [2018-02-02 19:56:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:32,722 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 409 transitions. [2018-02-02 19:56:32,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-02 19:56:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 409 transitions. [2018-02-02 19:56:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-02-02 19:56:32,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:32,723 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-02 19:56:32,723 INFO L371 AbstractCegarLoop]: === Iteration 62 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash 430852805, now seen corresponding path program 52 times [2018-02-02 19:56:32,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:32,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:33,822 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-02 19:56:33,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:33,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-02 19:56:33,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:33,823 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-02 19:56:33,823 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-02 19:56:33,823 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-02 19:56:33,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 19:56:33,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 19:56:33,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=2540, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 19:56:33,824 INFO L87 Difference]: Start difference. First operand 351 states and 409 transitions. Second operand 58 states. [2018-02-02 19:56:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:36,405 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2018-02-02 19:56:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 19:56:36,405 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 339 [2018-02-02 19:56:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:36,406 INFO L225 Difference]: With dead ends: 354 [2018-02-02 19:56:36,406 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 19:56:36,406 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-02 19:56:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 19:56:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-02-02 19:56:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 19:56:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 408 transitions. [2018-02-02 19:56:36,408 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 408 transitions. Word has length 339 [2018-02-02 19:56:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:36,409 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 408 transitions. [2018-02-02 19:56:36,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 19:56:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 408 transitions. [2018-02-02 19:56:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-02-02 19:56:36,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:36,409 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-02 19:56:36,410 INFO L371 AbstractCegarLoop]: === Iteration 63 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1572200423, now seen corresponding path program 53 times [2018-02-02 19:56:36,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:36,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:37,421 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-02 19:56:37,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:37,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 19:56:37,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:37,421 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-02 19:56:37,421 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-02 19:56:37,422 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-02 19:56:37,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 19:56:37,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 19:56:37,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=2577, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 19:56:37,422 INFO L87 Difference]: Start difference. First operand 351 states and 408 transitions. Second operand 59 states. [2018-02-02 19:56:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:38,358 INFO L93 Difference]: Finished difference Result 540 states and 628 transitions. [2018-02-02 19:56:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 19:56:38,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 345 [2018-02-02 19:56:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:38,359 INFO L225 Difference]: With dead ends: 540 [2018-02-02 19:56:38,359 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 19:56:38,360 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-02 19:56:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 19:56:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 363. [2018-02-02 19:56:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-02 19:56:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 423 transitions. [2018-02-02 19:56:38,362 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 423 transitions. Word has length 345 [2018-02-02 19:56:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:38,362 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 423 transitions. [2018-02-02 19:56:38,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 19:56:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 423 transitions. [2018-02-02 19:56:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-02-02 19:56:38,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:38,364 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-02 19:56:38,364 INFO L371 AbstractCegarLoop]: === Iteration 64 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1845667963, now seen corresponding path program 54 times [2018-02-02 19:56:38,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:38,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:39,568 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-02 19:56:39,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:39,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-02 19:56:39,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:39,569 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-02 19:56:39,569 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-02 19:56:39,569 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-02 19:56:39,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 19:56:39,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 19:56:39,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=2718, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 19:56:39,570 INFO L87 Difference]: Start difference. First operand 363 states and 423 transitions. Second operand 60 states. [2018-02-02 19:56:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:42,305 INFO L93 Difference]: Finished difference Result 366 states and 425 transitions. [2018-02-02 19:56:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 19:56:42,305 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 351 [2018-02-02 19:56:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:42,307 INFO L225 Difference]: With dead ends: 366 [2018-02-02 19:56:42,307 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 19:56:42,307 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-02 19:56:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 19:56:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2018-02-02 19:56:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-02 19:56:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 422 transitions. [2018-02-02 19:56:42,310 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 422 transitions. Word has length 351 [2018-02-02 19:56:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:42,310 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 422 transitions. [2018-02-02 19:56:42,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 19:56:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 422 transitions. [2018-02-02 19:56:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-02 19:56:42,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:42,312 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-02 19:56:42,312 INFO L371 AbstractCegarLoop]: === Iteration 65 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -624124711, now seen corresponding path program 55 times [2018-02-02 19:56:42,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:42,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:43,434 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-02 19:56:43,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:43,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 19:56:43,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:43,435 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-02 19:56:43,435 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-02 19:56:43,435 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-02 19:56:43,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 19:56:43,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 19:56:43,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=2756, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 19:56:43,436 INFO L87 Difference]: Start difference. First operand 363 states and 422 transitions. Second operand 61 states. [2018-02-02 19:56:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:44,207 INFO L93 Difference]: Finished difference Result 558 states and 649 transitions. [2018-02-02 19:56:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-02 19:56:44,207 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 357 [2018-02-02 19:56:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:44,208 INFO L225 Difference]: With dead ends: 558 [2018-02-02 19:56:44,208 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 19:56:44,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1889, Invalid=6121, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 19:56:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 19:56:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 375. [2018-02-02 19:56:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 19:56:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 437 transitions. [2018-02-02 19:56:44,211 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 437 transitions. Word has length 357 [2018-02-02 19:56:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:44,211 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 437 transitions. [2018-02-02 19:56:44,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 19:56:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2018-02-02 19:56:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-02-02 19:56:44,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:44,213 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-02 19:56:44,213 INFO L371 AbstractCegarLoop]: === Iteration 66 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1683221947, now seen corresponding path program 56 times [2018-02-02 19:56:44,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:44,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:45,502 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-02 19:56:45,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:45,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-02 19:56:45,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:45,502 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-02 19:56:45,502 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-02 19:56:45,503 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-02 19:56:45,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 19:56:45,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 19:56:45,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=2902, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 19:56:45,503 INFO L87 Difference]: Start difference. First operand 375 states and 437 transitions. Second operand 62 states. [2018-02-02 19:56:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:48,495 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-02 19:56:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 19:56:48,495 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 363 [2018-02-02 19:56:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:48,496 INFO L225 Difference]: With dead ends: 378 [2018-02-02 19:56:48,496 INFO L226 Difference]: Without dead ends: 378 [2018-02-02 19:56:48,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1934, Invalid=6808, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 19:56:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-02 19:56:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2018-02-02 19:56:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 19:56:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 436 transitions. [2018-02-02 19:56:48,499 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 436 transitions. Word has length 363 [2018-02-02 19:56:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:48,499 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 436 transitions. [2018-02-02 19:56:48,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 19:56:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 436 transitions. [2018-02-02 19:56:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-02-02 19:56:48,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:48,500 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-02 19:56:48,500 INFO L371 AbstractCegarLoop]: === Iteration 67 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1572095897, now seen corresponding path program 57 times [2018-02-02 19:56:48,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:48,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:49,736 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-02 19:56:49,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:49,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-02 19:56:49,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:49,736 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-02 19:56:49,737 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-02 19:56:49,737 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-02 19:56:49,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 19:56:49,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 19:56:49,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2941, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 19:56:49,738 INFO L87 Difference]: Start difference. First operand 375 states and 436 transitions. Second operand 63 states. [2018-02-02 19:56:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:50,592 INFO L93 Difference]: Finished difference Result 576 states and 670 transitions. [2018-02-02 19:56:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 19:56:50,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 369 [2018-02-02 19:56:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:50,593 INFO L225 Difference]: With dead ends: 576 [2018-02-02 19:56:50,593 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 19:56:50,594 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-02 19:56:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 19:56:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 387. [2018-02-02 19:56:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 19:56:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 451 transitions. [2018-02-02 19:56:50,596 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 451 transitions. Word has length 369 [2018-02-02 19:56:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:50,596 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 451 transitions. [2018-02-02 19:56:50,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-02 19:56:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 451 transitions. [2018-02-02 19:56:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-02-02 19:56:50,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:50,597 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-02 19:56:50,597 INFO L371 AbstractCegarLoop]: === Iteration 68 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1230174981, now seen corresponding path program 58 times [2018-02-02 19:56:50,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:50,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:52,025 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-02 19:56:52,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:52,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-02 19:56:52,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:52,026 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-02 19:56:52,026 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-02 19:56:52,026 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-02 19:56:52,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-02 19:56:52,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-02 19:56:52,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=940, Invalid=3092, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 19:56:52,027 INFO L87 Difference]: Start difference. First operand 387 states and 451 transitions. Second operand 64 states. [2018-02-02 19:56:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:55,159 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2018-02-02 19:56:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-02 19:56:55,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 375 [2018-02-02 19:56:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:55,161 INFO L225 Difference]: With dead ends: 390 [2018-02-02 19:56:55,161 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 19:56:55,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2060, Invalid=7252, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 19:56:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 19:56:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2018-02-02 19:56:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 19:56:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 450 transitions. [2018-02-02 19:56:55,163 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 450 transitions. Word has length 375 [2018-02-02 19:56:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:55,163 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 450 transitions. [2018-02-02 19:56:55,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-02 19:56:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 450 transitions. [2018-02-02 19:56:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-02-02 19:56:55,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:55,164 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-02 19:56:55,165 INFO L371 AbstractCegarLoop]: === Iteration 69 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 154771545, now seen corresponding path program 59 times [2018-02-02 19:56:55,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:55,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:56,416 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-02 19:56:56,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:56,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-02 19:56:56,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:56,417 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-02 19:56:56,417 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-02 19:56:56,418 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-02 19:56:56,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-02 19:56:56,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-02 19:56:56,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=3132, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 19:56:56,418 INFO L87 Difference]: Start difference. First operand 387 states and 450 transitions. Second operand 65 states. [2018-02-02 19:56:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:57,437 INFO L93 Difference]: Finished difference Result 594 states and 691 transitions. [2018-02-02 19:56:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 19:56:57,437 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 381 [2018-02-02 19:56:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:57,438 INFO L225 Difference]: With dead ends: 594 [2018-02-02 19:56:57,438 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 19:56:57,438 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-02 19:56:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 19:56:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 399. [2018-02-02 19:56:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 19:56:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 465 transitions. [2018-02-02 19:56:57,440 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 465 transitions. Word has length 381 [2018-02-02 19:56:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:57,440 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 465 transitions. [2018-02-02 19:56:57,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-02 19:56:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 465 transitions. [2018-02-02 19:56:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-02-02 19:56:57,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:57,441 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-02 19:56:57,441 INFO L371 AbstractCegarLoop]: === Iteration 70 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 19:56:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1263889979, now seen corresponding path program 60 times [2018-02-02 19:56:57,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:57,488 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-02 19:56:58,572 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:56:58,592 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:56:58,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:56:58 BoogieIcfgContainer [2018-02-02 19:56:58,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:56:58,593 INFO L168 Benchmark]: Toolchain (without parser) took 85411.53 ms. Allocated memory was 402.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.5 MB in the beginning and 2.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 19:56:58,594 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:56:58,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.43 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:58,594 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:58,594 INFO L168 Benchmark]: RCFGBuilder took 177.68 ms. Allocated memory is still 402.1 MB. Free memory was 344.2 MB in the beginning and 325.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:58,594 INFO L168 Benchmark]: TraceAbstraction took 85052.86 ms. Allocated memory was 402.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.4 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-02 19:56:58,595 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.10 ms. Allocated memory is still 402.1 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.43 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 345.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 21.38 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.68 ms. Allocated memory is still 402.1 MB. Free memory was 344.2 MB in the beginning and 325.7 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 85052.86 ms. Allocated memory was 402.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.4 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 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 388 with TraceHistMax 62, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 59 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. TIMEOUT Result, 85.0s OverallTime, 70 OverallIterations, 62 TraceHistogramMax, 50.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5038 SDtfs, 30503 SDslu, 61608 SDs, 0 SdLazy, 111059 SolverSat, 4034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3294 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41431 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 51925/214436 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 69 MinimizatonAttempts, 555 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 12421 NumberOfCodeBlocks, 12421 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 12352 ConstructedInterpolants, 0 QuantifiedInterpolants, 19030829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 6 PerfectInterpolantSequences, 51925/214436 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-02_19-56-58-602.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-02_19-56-58-602.csv Completed graceful shutdown