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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:56:30,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:56:30,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:56:30,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:56:30,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:56:30,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:56:30,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:56:30,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:56:30,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:56:30,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:56:30,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:56:30,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:56:30,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:56:30,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:56:30,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:56:30,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:56:30,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:56:30,623 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:56:30,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:56:30,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:56:30,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:56:30,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:56:30,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:56:30,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:56:30,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:56:30,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:56:30,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:56:30,632 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:56:30,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:56:30,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:56:30,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:56:30,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:56:30,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:56:30,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:56:30,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:56:30,644 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:56:30,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:56:30,645 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:56:30,645 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:56:30,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:56:30,646 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:56:30,647 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:56:30,647 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:56:30,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:56:30,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:56:30,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:56:30,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:56:30,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:56:30,648 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:56:30,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:56:30,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:56:30,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:56:30,649 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:56:30,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:56:30,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:56:30,649 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:56:30,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:56:30,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:56:30,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:56:30,651 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:56:30,651 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:56:30,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:56:30,696 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:56:30,701 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:56:30,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:56:30,703 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:56:30,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:30,876 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:56:30,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:56:30,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:30,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:56:30,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:56:30,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:30" (1/1) ... [2018-01-24 12:56:30,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:30, skipping insertion in model container [2018-01-24 12:56:30,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:30" (1/1) ... [2018-01-24 12:56:30,905 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:30,941 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:31,053 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:31,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:31,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31 WrapperNode [2018-01-24 12:56:31,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:31,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:56:31,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:56:31,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:56:31,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... [2018-01-24 12:56:31,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:56:31,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:56:31,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:56:31,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:56:31,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (1/1) ... No working directory specified, using /storage/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-01-24 12:56:31,153 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:56:31,154 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:56:31,154 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-01-24 12:56:31,154 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:56:31,154 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:56:31,155 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-01-24 12:56:31,155 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:56:31,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:56:31,155 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:56:31,371 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:56:31,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:31 BoogieIcfgContainer [2018-01-24 12:56:31,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:56:31,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:56:31,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:56:31,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:56:31,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:56:30" (1/3) ... [2018-01-24 12:56:31,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:31, skipping insertion in model container [2018-01-24 12:56:31,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:31" (2/3) ... [2018-01-24 12:56:31,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:31, skipping insertion in model container [2018-01-24 12:56:31,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:31" (3/3) ... [2018-01-24 12:56:31,377 INFO L105 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:31,384 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:56:31,389 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 12:56:31,433 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:56:31,433 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:56:31,433 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:56:31,433 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:56:31,433 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:56:31,433 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:56:31,433 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:56:31,434 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:56:31,434 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:56:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 12:56:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:56:31,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:31,459 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:31,459 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-01-24 12:56:31,467 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:31,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:31,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:31,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:31,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:31,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:31,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:31,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:56:31,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:31,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 12:56:31,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 12:56:31,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 12:56:31,622 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-01-24 12:56:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:31,641 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-01-24 12:56:31,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:56:31,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-24 12:56:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:31,650 INFO L225 Difference]: With dead ends: 85 [2018-01-24 12:56:31,650 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 12:56:31,653 INFO L525 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-01-24 12:56:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 12:56:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 12:56:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 12:56:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-24 12:56:31,754 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-01-24 12:56:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:31,755 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-24 12:56:31,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 12:56:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-24 12:56:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:56:31,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:31,756 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:31,756 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-01-24 12:56:31,756 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:31,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:31,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:31,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:31,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:31,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:31,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:31,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:56:31,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:31,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:56:31,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:56:31,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:31,873 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-01-24 12:56:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:32,052 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 12:56:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:56:32,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 12:56:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:32,053 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:56:32,054 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:56:32,055 INFO L525 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-01-24 12:56:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:56:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 12:56:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:56:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 12:56:32,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-01-24 12:56:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:32,061 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 12:56:32,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:56:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 12:56:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:56:32,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:32,062 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:32,062 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-01-24 12:56:32,063 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:32,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:32,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:32,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:32,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:32,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:56:32,120 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:32,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:56:32,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:56:32,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:56:32,121 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-01-24 12:56:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:32,155 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-24 12:56:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:56:32,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 12:56:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:32,157 INFO L225 Difference]: With dead ends: 69 [2018-01-24 12:56:32,157 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:56:32,158 INFO L525 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-01-24 12:56:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:56:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 12:56:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:56:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 12:56:32,164 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-01-24 12:56:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:32,165 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 12:56:32,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:56:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 12:56:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:56:32,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:32,166 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:32,166 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-01-24 12:56:32,167 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:32,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:32,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:32,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:32,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:32,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:56:32,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:32,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:56:32,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:56:32,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:32,313 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-01-24 12:56:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:32,618 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-24 12:56:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:56:32,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 12:56:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:32,622 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:56:32,622 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:56:32,622 INFO L525 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-01-24 12:56:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:56:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-01-24 12:56:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 12:56:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 12:56:32,631 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-01-24 12:56:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:32,631 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 12:56:32,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:56:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 12:56:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:56:32,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:32,633 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:32,633 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-01-24 12:56:32,633 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:32,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:32,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,635 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:32,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:32,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-01-24 12:56:32,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:32,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:56:32,732 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:32,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:56:32,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:56:32,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:32,733 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-24 12:56:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:32,878 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-01-24 12:56:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:56:32,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 12:56:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:32,879 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:56:32,879 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:56:32,880 INFO L525 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-01-24 12:56:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:56:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-01-24 12:56:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 12:56:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-01-24 12:56:32,887 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-01-24 12:56:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:32,887 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-01-24 12:56:32,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:56:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-01-24 12:56:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:56:32,888 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:32,888 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:32,888 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-01-24 12:56:32,889 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:32,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:32,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:32,890 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:32,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:32,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:32,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:56:32,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:32,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:56:32,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:56:32,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:56:32,974 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-01-24 12:56:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:33,047 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-24 12:56:33,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:56:33,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 12:56:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:33,048 INFO L225 Difference]: With dead ends: 63 [2018-01-24 12:56:33,048 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 12:56:33,049 INFO L525 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-01-24 12:56:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 12:56:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 12:56:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:56:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-01-24 12:56:33,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-01-24 12:56:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:33,058 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-01-24 12:56:33,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:56:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-01-24 12:56:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:56:33,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:33,059 INFO L322 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-01-24 12:56:33,059 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-01-24 12:56:33,059 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:33,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:33,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:33,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:33,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:33,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:33,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:33,155 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:56:33,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:33,167 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:33,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:33,321 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:33,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 12:56:33,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:33,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 12:56:33,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:33,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:33,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-01-24 12:56:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:33,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:33,568 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:56:33,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:33,572 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:33,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:33,684 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:33,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 12:56:33,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:33,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 12:56:33,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:33,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:33,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-01-24 12:56:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:33,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:33,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 19 [2018-01-24 12:56:33,775 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:33,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:56:33,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:56:33,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:56:33,776 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 14 states. [2018-01-24 12:56:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:34,146 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 12:56:34,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:56:34,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-01-24 12:56:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:34,147 INFO L225 Difference]: With dead ends: 69 [2018-01-24 12:56:34,147 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:56:34,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:56:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:56:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-01-24 12:56:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:56:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-01-24 12:56:34,153 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 22 [2018-01-24 12:56:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:34,153 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-01-24 12:56:34,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:56:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-01-24 12:56:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:56:34,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:34,154 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:34,154 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-01-24 12:56:34,154 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:34,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:34,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:34,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:34,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:34,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:34,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:34,219 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:56:34,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:34,226 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:34,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:34,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:34,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 12:56:34,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:34,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 12:56:34,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:34,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:34,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-01-24 12:56:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:34,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:34,457 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:56:34,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:34,460 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:34,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:34,644 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:34,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-24 12:56:34,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:34,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 12:56:34,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:34,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:34,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:17 [2018-01-24 12:56:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:34,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:34,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9, 9, 9] total 27 [2018-01-24 12:56:34,768 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:34,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:56:34,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:56:34,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:56:34,769 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 14 states. [2018-01-24 12:56:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:35,132 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-01-24 12:56:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:56:35,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-01-24 12:56:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:35,133 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:56:35,133 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 12:56:35,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 12:56:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 12:56:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2018-01-24 12:56:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:56:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 12:56:35,144 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 23 [2018-01-24 12:56:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:35,144 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 12:56:35,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:56:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 12:56:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:56:35,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:35,145 INFO L322 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-01-24 12:56:35,145 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:56:35,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1011769969, now seen corresponding path program 1 times [2018-01-24 12:56:35,146 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:35,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:35,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:35,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:35,147 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:35,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:35,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:35,359 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:56:35,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:35,366 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:35,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:35,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:35,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-24 12:56:35,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:35,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:35,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-01-24 12:56:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:35,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:35,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:56:35,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:35,656 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:35,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:35,777 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:35,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-24 12:56:35,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:35,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:35,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-01-24 12:56:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:35,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:35,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 29 [2018-01-24 12:56:35,826 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:35,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:56:35,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:56:35,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2018-01-24 12:56:35,827 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 17 states. [2018-01-24 12:56:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:36,141 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-01-24 12:56:36,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:56:36,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 12:56:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:36,142 INFO L225 Difference]: With dead ends: 74 [2018-01-24 12:56:36,142 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:56:36,143 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:56:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:56:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:56:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:56:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:56:36,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-24 12:56:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:36,144 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:56:36,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:56:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:56:36,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:56:36,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:56:36,565 WARN L146 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 82 DAG size of output 52 [2018-01-24 12:56:36,783 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 68 DAG size of output 46 [2018-01-24 12:56:36,807 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,807 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortEXIT(lines 540 556) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L404 ceAbstractionStarter]: At program point SelectionSortENTRY(lines 540 556) the Hoare annotation is: true [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 555) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 551) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr10RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L543'''(lines 543 555) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,808 INFO L401 ceAbstractionStarter]: For program point L547''''(lines 547 551) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L397 ceAbstractionStarter]: At program point L543''(lines 543 555) the Hoare annotation is: (let ((.cse5 (select |#length| SelectionSort_~a.base))) (let ((.cse2 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse0 (= SelectionSort_~a.offset 0)) (.cse1 (<= (* 4 SelectionSort_~array_size) .cse5))) (or (and .cse0 .cse1 (let ((.cse3 (<= 0 SelectionSort_~i~2)) (.cse6 (<= (+ SelectionSort_~min~3 1) SelectionSort_~j~3))) (or (let ((.cse4 (* 4 SelectionSort_~min~3))) (and .cse2 .cse3 (<= 0 (+ SelectionSort_~a.offset .cse4)) (<= (+ SelectionSort_~a.offset .cse4 8) .cse5) .cse6)) (and .cse2 (<= 1 SelectionSort_~min~3) .cse3 .cse6)))) (and .cse2 .cse0 (= SelectionSort_~i~2 0) .cse1) (< (select |#length| |SelectionSort_#in~a.base|) (* 4 |SelectionSort_#in~array_size|)) (not (= (select |#valid| |SelectionSort_#in~a.base|) 1)) (not (= 0 |SelectionSort_#in~a.offset|))))) [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point L547''(lines 547 551) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L397 ceAbstractionStarter]: At program point L547'''(lines 547 551) the Hoare annotation is: (let ((.cse4 (select |#length| SelectionSort_~a.base))) (let ((.cse1 (= SelectionSort_~a.offset 0)) (.cse0 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse2 (<= 0 SelectionSort_~i~2)) (.cse5 (<= (+ SelectionSort_~min~3 1) SelectionSort_~j~3)) (.cse3 (* 4 SelectionSort_~min~3)) (.cse6 (+ SelectionSort_~i~2 1)) (.cse7 (<= (* 4 SelectionSort_~array_size) .cse4))) (or (and .cse0 .cse1 .cse2 (<= (+ .cse3 4) .cse4) .cse5 (<= .cse6 SelectionSort_~min~3) .cse7) (and .cse1 (and (exists ((SelectionSort_~j~3 Int)) (and (<= (+ SelectionSort_~i~2 1) SelectionSort_~j~3) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~3) 4) (select |#length| SelectionSort_~a.base)))) .cse0 .cse2 (<= (+ SelectionSort_~a.offset .cse3 8) .cse4) .cse5 (<= 0 (+ SelectionSort_~a.offset .cse3)) (<= .cse6 SelectionSort_~j~3)) .cse7) (< (select |#length| |SelectionSort_#in~a.base|) (* 4 |SelectionSort_#in~array_size|)) (not (= (select |#valid| |SelectionSort_#in~a.base|) 1)) (not (= 0 |SelectionSort_#in~a.offset|))))) [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 12:56:36,809 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr11RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L397 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| |main_#t~malloc9.base|)))) [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 12:56:36,810 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 557 565) no Hoare annotation was computed. [2018-01-24 12:56:36,811 INFO L401 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2018-01-24 12:56:36,811 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 557 565) no Hoare annotation was computed. [2018-01-24 12:56:36,811 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 557 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:56:36,811 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 12:56:36,811 INFO L401 ceAbstractionStarter]: For program point L559''(lines 559 561) no Hoare annotation was computed. [2018-01-24 12:56:36,811 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 557 565) no Hoare annotation was computed. [2018-01-24 12:56:36,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,824 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,825 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,830 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,832 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:56:36 BoogieIcfgContainer [2018-01-24 12:56:36,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:56:36,836 INFO L168 Benchmark]: Toolchain (without parser) took 5959.98 ms. Allocated memory was 303.6 MB in the beginning and 539.5 MB in the end (delta: 235.9 MB). Free memory was 263.6 MB in the beginning and 431.2 MB in the end (delta: -167.7 MB). Peak memory consumption was 162.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:56:36,838 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:56:36,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.01 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:56:36,839 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:56:36,839 INFO L168 Benchmark]: RCFGBuilder took 263.80 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 233.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:56:36,839 INFO L168 Benchmark]: TraceAbstraction took 5463.02 ms. Allocated memory was 303.6 MB in the beginning and 539.5 MB in the end (delta: 235.9 MB). Free memory was 233.0 MB in the beginning and 431.2 MB in the end (delta: -198.2 MB). Peak memory consumption was 131.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:56:36,842 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.17 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 193.01 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.95 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.80 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 233.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5463.02 ms. Allocated memory was 303.6 MB in the beginning and 539.5 MB in the end (delta: 235.9 MB). Free memory was 233.0 MB in the beginning and 431.2 MB in the end (delta: -198.2 MB). Peak memory consumption was 131.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 12:56:36,848 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,848 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[a] && a == 0) && 0 <= i) && 4 * min + 4 <= unknown-#length-unknown[a]) && min + 1 <= j) && i + 1 <= min) && 4 * array_size <= unknown-#length-unknown[a]) || ((a == 0 && ((((((\exists SelectionSort_~j~3 : int :: i + 1 <= SelectionSort_~j~3 && a + 4 * SelectionSort_~j~3 + 4 <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 0 <= i) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && min + 1 <= j) && 0 <= a + 4 * min) && i + 1 <= j) && 4 * array_size <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4 * \old(array_size)) || !(\valid[a] == 1)) || !(0 == a) - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 12:56:36,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:56:36,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((a == 0 && 4 * array_size <= unknown-#length-unknown[a]) && (((((1 == \valid[a] && 0 <= i) && 0 <= a + 4 * min) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && min + 1 <= j) || (((1 == \valid[a] && 1 <= min) && 0 <= i) && min + 1 <= j))) || (((1 == \valid[a] && a == 0) && i == 0) && 4 * array_size <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4 * \old(array_size)) || !(\valid[a] == 1)) || !(0 == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 5.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 789 SDslu, 716 SDs, 0 SdLazy, 928 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 220 SyntacticMatches, 12 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 19 NumberOfFragments, 265 HoareAnnotationTreeSize, 8 FomulaSimplifications, 746 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1435 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 423 ConstructedInterpolants, 34 QuantifiedInterpolants, 66760 SizeOfPredicates, 34 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 15/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-56-36-860.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-56-36-860.csv Received shutdown request...