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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:26:22,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:26:22,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:26:22,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:26:22,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:26:22,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:26:22,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:26:22,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:26:22,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:26:22,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:26:22,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:26:22,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:26:22,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:26:22,897 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:26:22,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:26:22,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:26:22,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:26:22,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:26:22,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:26:22,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:26:22,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:26:22,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:26:22,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:26:22,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:26:22,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:26:22,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:26:22,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:26:22,913 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:26:22,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:26:22,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:26:22,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:26:22,915 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:26:22,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:26:22,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:26:22,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:26:22,927 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:26:22,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:26:22,927 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:26:22,927 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:26:22,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:26:22,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:26:22,928 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:26:22,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:26:22,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:26:22,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:26:22,929 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:26:22,929 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:26:22,929 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:26:22,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:26:22,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:26:22,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:26:22,930 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:26:22,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:26:22,931 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:26:22,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:26:22,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:26:22,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:26:22,932 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:26:22,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:26:22,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:26:22,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:26:22,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:26:22,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:26:22,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:26:22,934 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:26:22,934 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:26:22,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:26:23,004 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:26:23,008 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:26:23,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:26:23,010 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:26:23,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:26:23,204 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:26:23,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:26:23,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:26:23,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:26:23,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:26:23,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abbe019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23, skipping insertion in model container [2018-01-31 08:26:23,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,250 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:26:23,309 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:26:23,472 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:26:23,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:26:23,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23 WrapperNode [2018-01-31 08:26:23,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:26:23,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:26:23,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:26:23,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:26:23,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (1/1) ... [2018-01-31 08:26:23,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:26:23,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:26:23,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:26:23,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:26:23,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (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-31 08:26:23,633 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:26:23,633 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:26:23,634 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-01-31 08:26:23,634 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:26:23,634 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:26:23,636 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-01-31 08:26:23,637 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:26:23,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:26:23,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:26:24,156 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:26:24,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:26:24 BoogieIcfgContainer [2018-01-31 08:26:24,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:26:24,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:26:24,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:26:24,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:26:24,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:26:23" (1/3) ... [2018-01-31 08:26:24,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c213b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:26:24, skipping insertion in model container [2018-01-31 08:26:24,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:23" (2/3) ... [2018-01-31 08:26:24,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c213b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:26:24, skipping insertion in model container [2018-01-31 08:26:24,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:26:24" (3/3) ... [2018-01-31 08:26:24,164 INFO L107 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:26:24,171 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:26:24,177 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 08:26:24,223 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:26:24,223 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:26:24,223 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:26:24,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:26:24,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:26:24,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:26:24,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:26:24,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:26:24,224 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:26:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-31 08:26:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:26:24,248 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:24,250 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:24,250 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1712351626, now seen corresponding path program 1 times [2018-01-31 08:26:24,257 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:24,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:24,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:24,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:24,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:24,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:24,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:24,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:26:24,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:26:24,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:26:24,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:26:24,603 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 6 states. [2018-01-31 08:26:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:25,170 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-31 08:26:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:26:25,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-31 08:26:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:25,192 INFO L225 Difference]: With dead ends: 107 [2018-01-31 08:26:25,193 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 08:26:25,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:26:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 08:26:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-31 08:26:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 08:26:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-31 08:26:25,228 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 22 [2018-01-31 08:26:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:25,229 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-31 08:26:25,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:26:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-31 08:26:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:26:25,230 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:25,230 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:25,230 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:25,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1712351625, now seen corresponding path program 1 times [2018-01-31 08:26:25,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:25,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:25,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:25,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:25,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:25,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:25,666 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-31 08:26:25,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:25,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:26:25,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:26:25,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:26:25,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:26:25,668 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 9 states. [2018-01-31 08:26:26,037 WARN L143 SmtUtils]: Spent 159ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 08:26:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:26,317 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-01-31 08:26:26,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:26:26,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-31 08:26:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:26,321 INFO L225 Difference]: With dead ends: 90 [2018-01-31 08:26:26,322 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:26:26,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:26:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:26:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-01-31 08:26:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 08:26:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-31 08:26:26,333 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2018-01-31 08:26:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:26,334 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-31 08:26:26,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:26:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-31 08:26:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 08:26:26,334 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:26,335 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:26,335 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash -100970791, now seen corresponding path program 1 times [2018-01-31 08:26:26,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:26,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:26,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:26,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:26,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:26,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:26,419 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-31 08:26:26,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:26,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:26:26,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:26:26,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:26:26,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:26:26,420 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2018-01-31 08:26:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:26,538 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-31 08:26:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:26:26,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-31 08:26:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:26,539 INFO L225 Difference]: With dead ends: 61 [2018-01-31 08:26:26,539 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 08:26:26,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:26:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 08:26:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-31 08:26:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 08:26:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-31 08:26:26,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 27 [2018-01-31 08:26:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:26,557 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-31 08:26:26,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:26:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-31 08:26:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:26:26,558 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:26,558 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:26,559 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash 321090949, now seen corresponding path program 1 times [2018-01-31 08:26:26,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:26,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:26,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:26,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:26,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:26,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:26,723 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-31 08:26:26,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:26,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:26:26,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:26:26,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:26:26,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:26:26,725 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2018-01-31 08:26:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:27,368 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-31 08:26:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:26:27,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-31 08:26:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:27,370 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:26:27,370 INFO L226 Difference]: Without dead ends: 108 [2018-01-31 08:26:27,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:26:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-31 08:26:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2018-01-31 08:26:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:26:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-31 08:26:27,381 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 29 [2018-01-31 08:26:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:27,381 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-31 08:26:27,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:26:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-31 08:26:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:26:27,382 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:27,382 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:27,383 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash 734084889, now seen corresponding path program 1 times [2018-01-31 08:26:27,383 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:27,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:27,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:27,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:27,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:27,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:27,483 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-31 08:26:27,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:27,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:26:27,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:26:27,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:26:27,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:26:27,484 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 5 states. [2018-01-31 08:26:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:27,552 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-01-31 08:26:27,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:26:27,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-31 08:26:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:27,553 INFO L225 Difference]: With dead ends: 143 [2018-01-31 08:26:27,553 INFO L226 Difference]: Without dead ends: 108 [2018-01-31 08:26:27,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:26:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-31 08:26:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2018-01-31 08:26:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:26:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-31 08:26:27,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 32 [2018-01-31 08:26:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:27,564 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-31 08:26:27,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:26:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-31 08:26:27,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:26:27,565 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:27,565 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:27,565 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -213319338, now seen corresponding path program 1 times [2018-01-31 08:26:27,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:27,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:27,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:27,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:27,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:27,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:27,936 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-31 08:26:27,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:27,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:26:27,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:26:27,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:26:27,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:26:27,937 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 10 states. [2018-01-31 08:26:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:28,305 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-01-31 08:26:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:26:28,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-31 08:26:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:28,306 INFO L225 Difference]: With dead ends: 108 [2018-01-31 08:26:28,307 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 08:26:28,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:26:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 08:26:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2018-01-31 08:26:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 08:26:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-01-31 08:26:28,316 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 34 [2018-01-31 08:26:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:28,317 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-01-31 08:26:28,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:26:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-01-31 08:26:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:26:28,318 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:28,318 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:28,319 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1321126528, now seen corresponding path program 1 times [2018-01-31 08:26:28,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:28,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:28,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:28,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:28,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:28,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:28,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:28,624 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:26:28,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:28,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:28,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:26:28,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:26:28,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:26:28,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:26:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:29,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:29,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-31 08:26:29,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:26:29,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:26:29,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2018-01-31 08:26:29,547 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 16 states. [2018-01-31 08:26:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:29,957 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-31 08:26:29,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:26:29,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-01-31 08:26:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:29,958 INFO L225 Difference]: With dead ends: 93 [2018-01-31 08:26:29,958 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 08:26:29,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=379, Unknown=1, NotChecked=0, Total=506 [2018-01-31 08:26:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 08:26:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2018-01-31 08:26:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 08:26:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-31 08:26:29,969 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 40 [2018-01-31 08:26:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:29,969 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-31 08:26:29,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:26:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-31 08:26:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:26:29,971 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:29,971 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:29,971 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1522750488, now seen corresponding path program 1 times [2018-01-31 08:26:29,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:29,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:29,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:29,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:29,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:29,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:30,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:30,226 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:26:30,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:30,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:30,281 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-31 08:26:30,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:30,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-31 08:26:30,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:26:30,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:26:30,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:26:30,301 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2018-01-31 08:26:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:30,673 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-31 08:26:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:26:30,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-01-31 08:26:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:30,676 INFO L225 Difference]: With dead ends: 130 [2018-01-31 08:26:30,676 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:26:30,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:26:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:26:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2018-01-31 08:26:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:26:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-31 08:26:30,690 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 43 [2018-01-31 08:26:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:30,690 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-31 08:26:30,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:26:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-31 08:26:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:26:30,692 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:30,692 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:30,692 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash 820999078, now seen corresponding path program 1 times [2018-01-31 08:26:30,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:30,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:30,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:30,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:30,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:30,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:30,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:30,983 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:26:30,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:31,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:31,760 WARN L143 SmtUtils]: Spent 328ms on a formula simplification that was a NOOP. DAG size: 23 [2018-01-31 08:26:32,021 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-31 08:26:32,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:32,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2018-01-31 08:26:32,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:26:32,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:26:32,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:26:32,041 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 25 states. [2018-01-31 08:26:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:33,472 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-01-31 08:26:33,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:26:33,472 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-01-31 08:26:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:33,473 INFO L225 Difference]: With dead ends: 138 [2018-01-31 08:26:33,473 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 08:26:33,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=418, Invalid=1562, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 08:26:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 08:26:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2018-01-31 08:26:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:26:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-31 08:26:33,493 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 46 [2018-01-31 08:26:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:33,494 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-31 08:26:33,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:26:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-31 08:26:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:26:33,495 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:33,496 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:33,496 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1954785956, now seen corresponding path program 1 times [2018-01-31 08:26:33,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:33,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:33,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:33,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:33,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:33,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:26:33,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:33,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:26:33,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:26:33,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:26:33,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:26:33,682 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 10 states. [2018-01-31 08:26:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:33,968 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-01-31 08:26:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:26:33,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-01-31 08:26:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:33,969 INFO L225 Difference]: With dead ends: 109 [2018-01-31 08:26:33,969 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 08:26:33,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:26:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 08:26:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2018-01-31 08:26:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:26:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-01-31 08:26:33,991 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 47 [2018-01-31 08:26:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:33,992 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-01-31 08:26:33,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:26:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-01-31 08:26:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:26:33,993 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:33,994 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:33,994 INFO L371 AbstractCegarLoop]: === Iteration 11 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:26:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash -235917393, now seen corresponding path program 1 times [2018-01-31 08:26:33,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:33,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:33,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:33,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:33,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:34,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:26:34,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:34,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:26:34,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:26:34,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:26:34,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:26:34,297 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 11 states. [2018-01-31 08:26:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:34,502 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-01-31 08:26:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:26:34,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-01-31 08:26:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:34,503 INFO L225 Difference]: With dead ends: 111 [2018-01-31 08:26:34,503 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:26:34,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:26:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:26:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:26:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:26:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:26:34,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2018-01-31 08:26:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:34,505 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:26:34,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:26:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:26:34,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:26:34,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:26:34,534 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:26:34,684 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 93 DAG size of output 85 [2018-01-31 08:26:36,185 WARN L146 SmtUtils]: Spent 1414ms on a formula simplification. DAG size of input: 89 DAG size of output 64 [2018-01-31 08:26:36,510 WARN L146 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 96 DAG size of output 57 [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point insertionSortErr8RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L546'''''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 550) no Hoare annotation was computed. [2018-01-31 08:26:36,512 INFO L399 ceAbstractionStarter]: For program point L546'''''''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L543''''''(lines 543 549) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point insertionSortErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L395 ceAbstractionStarter]: At program point L546'''''''''''''''(lines 546 547) the Hoare annotation is: (let ((.cse4 (select |#length| |insertionSort_#in~a.base|)) (.cse0 (select |#valid| |insertionSort_#in~a.base|)) (.cse5 (= 0 |insertionSort_#in~a.offset|)) (.cse2 (select |#length| insertionSort_~a.base)) (.cse6 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |insertionSort_#in~a.base|)))))) (let ((.cse1 (* 4 insertionSort_~j~2)) (.cse3 (let ((.cse7 (* 4 insertionSort_~i~2))) (and (<= (+ .cse7 4) .cse2) (<= 4 (+ insertionSort_~a.offset .cse7)) (and (<= 4 .cse4) (= 1 .cse0) .cse5 (= 1 (select |#valid| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (<= (* 4 |insertionSort_#in~array_size|) .cse2)) .cse6 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_1))))))) (or (not (= .cse0 1)) (and (<= (+ insertionSort_~a.offset .cse1 4) .cse2) (< 0 insertionSort_~j~2) .cse3) (< .cse4 4) (not .cse5) (not .cse6) (and (<= 0 insertionSort_~j~2) (<= (+ insertionSort_~a.offset .cse1 8) .cse2) .cse3)))) [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point insertionSortErr9RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-31 08:26:36,513 INFO L399 ceAbstractionStarter]: For program point L546'''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point insertionSortErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 549) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point insertionSortEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point insertionSortErr7RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L546''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point insertionSortErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L546''''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,514 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L395 ceAbstractionStarter]: At program point L543'''''(lines 543 549) the Hoare annotation is: (let ((.cse7 (select |#length| insertionSort_~a.base))) (let ((.cse0 (<= 4 .cse7)) (.cse4 (select |#valid| |insertionSort_#in~a.base|)) (.cse1 (= 1 (select |#valid| insertionSort_~a.base))) (.cse2 (<= (* 4 |insertionSort_#in~array_size|) .cse7)) (.cse5 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |insertionSort_#in~a.base|))))) (.cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_1))))) (or (and .cse0 .cse1 .cse2 (= 0 insertionSort_~a.offset) (= 1 insertionSort_~i~2) .cse3) (not (= .cse4 1)) (< (select |#length| |insertionSort_#in~a.base|) 4) (not (= 0 |insertionSort_#in~a.offset|)) (not .cse5) (and (let ((.cse6 (and .cse0 (= 1 .cse4) .cse1 .cse2 (<= 2 insertionSort_~i~2) (= |insertionSort_#in~a.offset| 0) .cse5 .cse3))) (or (and (<= 0 insertionSort_~j~2) (<= insertionSort_~j~2 0) .cse6 (exists ((insertionSort_~i~2 Int)) (and (<= 1 insertionSort_~i~2) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~i~2) 4) (select |#length| insertionSort_~a.base))))) (and (< 0 insertionSort_~j~2) .cse6 (<= (+ (* 4 insertionSort_~j~2) 4) .cse7)))) (= insertionSort_~a.offset 0))))) [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point insertionSortErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point insertionSortErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L402 ceAbstractionStarter]: At program point insertionSortENTRY(lines 540 550) the Hoare annotation is: true [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point insertionSortErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point insertionSortErr6RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,515 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:26:36,516 INFO L399 ceAbstractionStarter]: For program point L553(lines 553 555) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L395 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~a~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= .cse0 (select |#length| main_~a~5.base)) (= 0 main_~a~5.offset) (<= 1 main_~array_size~5) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc9.base| (select (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc9.base|))))) [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 551 559) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 551 559) no Hoare annotation was computed. [2018-01-31 08:26:36,517 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 551 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:26:36,517 INFO L399 ceAbstractionStarter]: For program point L553''(lines 553 555) no Hoare annotation was computed. [2018-01-31 08:26:36,518 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-31 08:26:36,518 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-31 08:26:36,518 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-31 08:26:36,518 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 551 559) no Hoare annotation was computed. [2018-01-31 08:26:36,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,531 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,540 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,541 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,564 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,565 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:26:36 BoogieIcfgContainer [2018-01-31 08:26:36,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:26:36,577 INFO L168 Benchmark]: Toolchain (without parser) took 13371.72 ms. Allocated memory was 306.2 MB in the beginning and 554.2 MB in the end (delta: 248.0 MB). Free memory was 266.1 MB in the beginning and 461.5 MB in the end (delta: -195.4 MB). Peak memory consumption was 174.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:36,579 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:26:36,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.64 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:36,579 INFO L168 Benchmark]: Boogie Preprocessor took 54.01 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:36,580 INFO L168 Benchmark]: RCFGBuilder took 591.27 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 234.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:36,580 INFO L168 Benchmark]: TraceAbstraction took 12418.77 ms. Allocated memory was 306.2 MB in the beginning and 554.2 MB in the end (delta: 248.0 MB). Free memory was 234.1 MB in the beginning and 461.5 MB in the end (delta: -227.4 MB). Peak memory consumption was 142.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:36,582 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 293.64 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.01 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 591.27 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 234.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12418.77 ms. Allocated memory was 306.2 MB in the beginning and 554.2 MB in the end (delta: 248.0 MB). Free memory was 234.1 MB in the beginning and 461.5 MB in the end (delta: -227.4 MB). Peak memory consumption was 142.3 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[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,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 - 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 - 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: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-31 08:26:36,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,595 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,596 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,597 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,598 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,603 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,604 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,605 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[insertionSort_~i~2,QUANTIFIED] [2018-01-31 08:26:36,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,606 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 4 * \old(array_size) <= unknown-#length-unknown[a]) && 0 == a) && 1 == i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) || !(\valid[a] == 1)) || unknown-#length-unknown[a] < 4) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || (((((0 <= j && j <= 0) && ((((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 1 == \valid[a]) && 4 * \old(array_size) <= unknown-#length-unknown[a]) && 2 <= i) && a == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) && (\exists insertionSort_~i~2 : int :: 1 <= insertionSort_~i~2 && a + 4 * insertionSort_~i~2 + 4 <= unknown-#length-unknown[a])) || ((0 < j && ((((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 1 == \valid[a]) && 4 * \old(array_size) <= unknown-#length-unknown[a]) && 2 <= i) && a == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) && 4 * j + 4 <= unknown-#length-unknown[a])) && a == 0) - InvariantResult [Line: 546]: Loop Invariant [2018-01-31 08:26:36,611 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:26:36,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,621 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,622 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:36,623 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || ((a + 4 * j + 4 <= unknown-#length-unknown[a] && 0 < j) && (((4 * i + 4 <= unknown-#length-unknown[a] && 4 <= a + 4 * i) && ((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 0 == a) && 1 == \valid[a]) && a == 0) && 4 * \old(array_size) <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1))) || unknown-#length-unknown[a] < 4) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || ((0 <= j && a + 4 * j + 8 <= unknown-#length-unknown[a]) && (((4 * i + 4 <= unknown-#length-unknown[a] && 4 <= a + 4 * i) && ((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 0 == a) && 1 == \valid[a]) && a == 0) && 4 * \old(array_size) <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 11 error locations. SAFE Result, 12.3s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 529 SDtfs, 2356 SDslu, 2063 SDs, 0 SdLazy, 1385 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=10, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 239 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 464 HoareAnnotationTreeSize, 8 FomulaSimplifications, 28165 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 8281 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 518 ConstructedInterpolants, 51 QuantifiedInterpolants, 142651 SizeOfPredicates, 17 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 41/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-26-36-631.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-26-36-631.csv Received shutdown request...