java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:21:15,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:21:15,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:21:15,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:21:15,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:21:15,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:21:15,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:21:15,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:21:15,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:21:15,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:21:15,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:21:15,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:21:15,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:21:15,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:21:15,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:21:15,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:21:15,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:21:15,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:21:15,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:21:15,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:21:15,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:21:15,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:21:15,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:21:15,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:21:15,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:21:15,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:21:15,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:21:15,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:21:15,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:21:15,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:21:15,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:21:15,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:21:15,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:21:15,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:21:15,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:21:15,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:21:15,829 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:21:15,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:21:15,856 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:21:15,857 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:21:15,857 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:21:15,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:21:15,858 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:21:15,858 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:21:15,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:21:15,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:21:15,860 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:21:15,860 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:21:15,860 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:21:15,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:21:15,860 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:21:15,861 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:21:15,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:21:15,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:21:15,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:21:15,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:21:15,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:21:15,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:21:15,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:21:15,863 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:21:15,863 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:21:15,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:21:15,863 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:21:15,863 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:21:15,864 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:21:15,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:21:15,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:21:15,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:21:15,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:21:15,947 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:21:15,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:21:16,014 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278e6becb/fcb639ad03a9430dbdc647a767f53da4/FLAG55ff8fb75 [2018-11-23 11:21:16,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:21:16,602 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:21:16,618 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278e6becb/fcb639ad03a9430dbdc647a767f53da4/FLAG55ff8fb75 [2018-11-23 11:21:16,876 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278e6becb/fcb639ad03a9430dbdc647a767f53da4 [2018-11-23 11:21:16,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:21:16,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:21:16,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:16,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:21:16,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:21:16,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:16" (1/1) ... [2018-11-23 11:21:16,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a385c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:16, skipping insertion in model container [2018-11-23 11:21:16,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:16" (1/1) ... [2018-11-23 11:21:16,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:21:16,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:21:17,418 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:17,433 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:21:17,540 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:17,711 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:21:17,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17 WrapperNode [2018-11-23 11:21:17,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:17,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:17,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:21:17,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:21:17,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:17,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:21:17,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:21:17,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:21:17,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... [2018-11-23 11:21:17,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:21:17,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:21:17,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:21:17,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:21:17,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (1/1) ... No working directory specified, using /storage/repos/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-11-23 11:21:17,920 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:21:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:21:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:21:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 11:21:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 11:21:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:21:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:21:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:21:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:21:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:21:17,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:21:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-23 11:21:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-23 11:21:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:21:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:21:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:21:17,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:21:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:21:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:21:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 11:21:17,926 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 11:21:17,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:21:17,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:21:19,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:21:19,048 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:21:19,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:19 BoogieIcfgContainer [2018-11-23 11:21:19,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:21:19,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:21:19,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:21:19,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:21:19,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:21:16" (1/3) ... [2018-11-23 11:21:19,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db858f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:19, skipping insertion in model container [2018-11-23 11:21:19,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:17" (2/3) ... [2018-11-23 11:21:19,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db858f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:19, skipping insertion in model container [2018-11-23 11:21:19,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:19" (3/3) ... [2018-11-23 11:21:19,057 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:21:19,067 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:21:19,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:21:19,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:21:19,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:21:19,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:21:19,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:21:19,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:21:19,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:21:19,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:21:19,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:21:19,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:21:19,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:21:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-11-23 11:21:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:21:19,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:19,158 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:21:19,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:19,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1110829348, now seen corresponding path program 1 times [2018-11-23 11:21:19,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:19,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:19,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:19,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {65#true} is VALID [2018-11-23 11:21:19,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {65#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {65#true} is VALID [2018-11-23 11:21:19,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2018-11-23 11:21:19,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #161#return; {65#true} is VALID [2018-11-23 11:21:19,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {65#true} call #t~ret22 := main(); {65#true} is VALID [2018-11-23 11:21:19,388 INFO L256 TraceCheckUtils]: 5: Hoare triple {65#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {65#true} is VALID [2018-11-23 11:21:19,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {65#true} is VALID [2018-11-23 11:21:19,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {65#true} assume !true; {66#false} is VALID [2018-11-23 11:21:19,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {66#false} #res := ~len~1; {66#false} is VALID [2018-11-23 11:21:19,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:19,390 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {66#false} {65#true} #143#return; {66#false} is VALID [2018-11-23 11:21:19,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {66#false} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {66#false} is VALID [2018-11-23 11:21:19,391 INFO L256 TraceCheckUtils]: 12: Hoare triple {66#false} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {66#false} is VALID [2018-11-23 11:21:19,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {66#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {66#false} is VALID [2018-11-23 11:21:19,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:19,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {66#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {66#false} is VALID [2018-11-23 11:21:19,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:19,393 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {66#false} {66#false} #145#return; {66#false} is VALID [2018-11-23 11:21:19,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {66#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {66#false} is VALID [2018-11-23 11:21:19,393 INFO L256 TraceCheckUtils]: 19: Hoare triple {66#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {66#false} is VALID [2018-11-23 11:21:19,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {66#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {66#false} is VALID [2018-11-23 11:21:19,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:19,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {66#false} #res := ~len~1; {66#false} is VALID [2018-11-23 11:21:19,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:19,395 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {66#false} {66#false} #147#return; {66#false} is VALID [2018-11-23 11:21:19,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {66#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {66#false} is VALID [2018-11-23 11:21:19,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:19,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {66#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {66#false} is VALID [2018-11-23 11:21:19,397 INFO L256 TraceCheckUtils]: 28: Hoare triple {66#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {66#false} is VALID [2018-11-23 11:21:19,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {66#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {66#false} is VALID [2018-11-23 11:21:19,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {66#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {66#false} is VALID [2018-11-23 11:21:19,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {66#false} #res := ~len~0; {66#false} is VALID [2018-11-23 11:21:19,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:19,399 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {66#false} {66#false} #153#return; {66#false} is VALID [2018-11-23 11:21:19,399 INFO L273 TraceCheckUtils]: 34: Hoare triple {66#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {66#false} is VALID [2018-11-23 11:21:19,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {66#false} assume !false; {66#false} is VALID [2018-11-23 11:21:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:21:19,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:19,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:19,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:21:19,422 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 11:21:19,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:19,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:21:19,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:19,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:21:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:21:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:21:19,650 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-11-23 11:21:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:20,467 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2018-11-23 11:21:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:21:20,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 11:21:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:21:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-23 11:21:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:21:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-23 11:21:20,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 158 transitions. [2018-11-23 11:21:21,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:21,105 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:21:21,106 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:21:21,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:21:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:21:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:21:21,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:21,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:21,169 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:21,169 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:21,176 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:21:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:21,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:21,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:21,178 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:21,178 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:21,184 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:21:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:21,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:21,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:21,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:21,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:21:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-23 11:21:21,192 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 36 [2018-11-23 11:21:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:21,193 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-23 11:21:21,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:21:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:21:21,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:21,195 INFO L402 BasicCegarLoop]: trace histogram [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-11-23 11:21:21,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:21,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1172876686, now seen corresponding path program 1 times [2018-11-23 11:21:21,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:21,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:21,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-23 11:21:21,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {503#true} is VALID [2018-11-23 11:21:21,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-23 11:21:21,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} #161#return; {503#true} is VALID [2018-11-23 11:21:21,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {503#true} call #t~ret22 := main(); {503#true} is VALID [2018-11-23 11:21:21,755 INFO L256 TraceCheckUtils]: 5: Hoare triple {503#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {503#true} is VALID [2018-11-23 11:21:21,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:21,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:21,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:21,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:21,759 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {503#true} #143#return; {540#(= (_ bv2 32) |main_#t~ret13|)} is VALID [2018-11-23 11:21:21,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {540#(= (_ bv2 32) |main_#t~ret13|)} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:21,761 INFO L256 TraceCheckUtils]: 12: Hoare triple {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {503#true} is VALID [2018-11-23 11:21:21,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {551#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:21:21,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {551#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {555#(= |sll_create_#in~len| |sll_create_#t~post2|)} is VALID [2018-11-23 11:21:21,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {555#(= |sll_create_#in~len| |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:21,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:21,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:21,777 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {504#false} is VALID [2018-11-23 11:21:21,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {504#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {504#false} is VALID [2018-11-23 11:21:21,777 INFO L256 TraceCheckUtils]: 20: Hoare triple {504#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {504#false} is VALID [2018-11-23 11:21:21,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {504#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {504#false} is VALID [2018-11-23 11:21:21,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {504#false} is VALID [2018-11-23 11:21:21,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#false} #res := ~len~1; {504#false} is VALID [2018-11-23 11:21:21,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {504#false} assume true; {504#false} is VALID [2018-11-23 11:21:21,778 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {504#false} {504#false} #147#return; {504#false} is VALID [2018-11-23 11:21:21,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {504#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {504#false} is VALID [2018-11-23 11:21:21,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {504#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {504#false} is VALID [2018-11-23 11:21:21,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {504#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {504#false} is VALID [2018-11-23 11:21:21,780 INFO L256 TraceCheckUtils]: 29: Hoare triple {504#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {504#false} is VALID [2018-11-23 11:21:21,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {504#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {504#false} is VALID [2018-11-23 11:21:21,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {504#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {504#false} is VALID [2018-11-23 11:21:21,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {504#false} #res := ~len~0; {504#false} is VALID [2018-11-23 11:21:21,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {504#false} assume true; {504#false} is VALID [2018-11-23 11:21:21,781 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {504#false} {504#false} #153#return; {504#false} is VALID [2018-11-23 11:21:21,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {504#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {504#false} is VALID [2018-11-23 11:21:21,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-23 11:21:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:21,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:21,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:21,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:21:21,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:21:21,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:21,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:21:21,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:21:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:21:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:21:21,865 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2018-11-23 11:21:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:23,387 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-23 11:21:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:21:23,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:21:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-23 11:21:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-23 11:21:23,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 128 transitions. [2018-11-23 11:21:23,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:23,723 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:21:23,723 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:21:23,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:21:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:21:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-11-23 11:21:23,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:23,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:23,780 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:23,780 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:23,789 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2018-11-23 11:21:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-23 11:21:23,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:23,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:23,792 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 72 states. [2018-11-23 11:21:23,792 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 72 states. [2018-11-23 11:21:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:23,800 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2018-11-23 11:21:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-23 11:21:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:23,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:23,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:23,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:21:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-11-23 11:21:23,813 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 37 [2018-11-23 11:21:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:23,814 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-11-23 11:21:23,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:21:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 11:21:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:21:23,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:23,820 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:21:23,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1295334673, now seen corresponding path program 1 times [2018-11-23 11:21:23,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:23,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:23,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:23,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:24,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2018-11-23 11:21:24,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {993#true} is VALID [2018-11-23 11:21:24,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:24,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #161#return; {993#true} is VALID [2018-11-23 11:21:24,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret22 := main(); {993#true} is VALID [2018-11-23 11:21:24,141 INFO L256 TraceCheckUtils]: 5: Hoare triple {993#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {993#true} is VALID [2018-11-23 11:21:24,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1016#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:24,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {1016#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:24,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:24,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} #res := ~len~1; {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:24,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume true; {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:24,152 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} {993#true} #143#return; {1034#(= (bvadd |main_#t~ret13| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:24,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(= (bvadd |main_#t~ret13| (_ bv4294967293 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:24,153 INFO L256 TraceCheckUtils]: 13: Hoare triple {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {993#true} is VALID [2018-11-23 11:21:24,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {993#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1045#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:21:24,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {1045#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1049#(= |sll_create_#in~len| |sll_create_#t~post2|)} is VALID [2018-11-23 11:21:24,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#(= |sll_create_#in~len| |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,160 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} #145#return; {994#false} is VALID [2018-11-23 11:21:24,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {994#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {994#false} is VALID [2018-11-23 11:21:24,160 INFO L256 TraceCheckUtils]: 21: Hoare triple {994#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {994#false} is VALID [2018-11-23 11:21:24,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {994#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {994#false} is VALID [2018-11-23 11:21:24,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {994#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {994#false} is VALID [2018-11-23 11:21:24,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {994#false} #res := ~len~1; {994#false} is VALID [2018-11-23 11:21:24,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {994#false} assume true; {994#false} is VALID [2018-11-23 11:21:24,162 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {994#false} {994#false} #147#return; {994#false} is VALID [2018-11-23 11:21:24,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {994#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:24,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {994#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {994#false} is VALID [2018-11-23 11:21:24,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {994#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {994#false} is VALID [2018-11-23 11:21:24,163 INFO L256 TraceCheckUtils]: 30: Hoare triple {994#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {994#false} is VALID [2018-11-23 11:21:24,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {994#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:24,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {994#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {994#false} is VALID [2018-11-23 11:21:24,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {994#false} #res := ~len~0; {994#false} is VALID [2018-11-23 11:21:24,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {994#false} assume true; {994#false} is VALID [2018-11-23 11:21:24,165 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {994#false} {994#false} #153#return; {994#false} is VALID [2018-11-23 11:21:24,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {994#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {994#false} is VALID [2018-11-23 11:21:24,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {994#false} assume !false; {994#false} is VALID [2018-11-23 11:21:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:24,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:24,795 INFO L273 TraceCheckUtils]: 37: Hoare triple {994#false} assume !false; {994#false} is VALID [2018-11-23 11:21:24,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {994#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {994#false} is VALID [2018-11-23 11:21:24,797 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {993#true} {994#false} #153#return; {994#false} is VALID [2018-11-23 11:21:24,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:24,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {993#true} #res := ~len~0; {993#true} is VALID [2018-11-23 11:21:24,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {993#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {993#true} is VALID [2018-11-23 11:21:24,798 INFO L273 TraceCheckUtils]: 31: Hoare triple {993#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {993#true} is VALID [2018-11-23 11:21:24,799 INFO L256 TraceCheckUtils]: 30: Hoare triple {994#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {993#true} is VALID [2018-11-23 11:21:24,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {994#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {994#false} is VALID [2018-11-23 11:21:24,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {994#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {994#false} is VALID [2018-11-23 11:21:24,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {994#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:24,800 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {993#true} {994#false} #147#return; {994#false} is VALID [2018-11-23 11:21:24,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:24,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {993#true} #res := ~len~1; {993#true} is VALID [2018-11-23 11:21:24,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {993#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {993#true} is VALID [2018-11-23 11:21:24,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {993#true} is VALID [2018-11-23 11:21:24,801 INFO L256 TraceCheckUtils]: 21: Hoare triple {994#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {993#true} is VALID [2018-11-23 11:21:24,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {994#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {994#false} is VALID [2018-11-23 11:21:24,814 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {1171#(bvsgt main_~len~2 (_ bv0 32))} #145#return; {994#false} is VALID [2018-11-23 11:21:24,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {1184#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt |sll_create_#in~len| (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {1188#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1184#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt |sll_create_#in~len| (_ bv0 32))))} is VALID [2018-11-23 11:21:24,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {993#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1188#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:21:24,818 INFO L256 TraceCheckUtils]: 13: Hoare triple {1171#(bvsgt main_~len~2 (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {993#true} is VALID [2018-11-23 11:21:24,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {1195#(bvsgt |main_#t~ret13| (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1171#(bvsgt main_~len~2 (_ bv0 32))} is VALID [2018-11-23 11:21:24,820 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} {993#true} #143#return; {1195#(bvsgt |main_#t~ret13| (_ bv0 32))} is VALID [2018-11-23 11:21:24,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} assume true; {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} #res := ~len~1; {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} is VALID [2018-11-23 11:21:24,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:21:24,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {1216#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:21:24,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1216#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:21:24,840 INFO L256 TraceCheckUtils]: 5: Hoare triple {993#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {993#true} is VALID [2018-11-23 11:21:24,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret22 := main(); {993#true} is VALID [2018-11-23 11:21:24,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #161#return; {993#true} is VALID [2018-11-23 11:21:24,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:24,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {993#true} is VALID [2018-11-23 11:21:24,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2018-11-23 11:21:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:21:24,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:21:24,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 11:21:24,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 11:21:24,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:24,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:21:25,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:25,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:21:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:21:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:21:25,068 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 17 states. [2018-11-23 11:21:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:29,109 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2018-11-23 11:21:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:21:29,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 11:21:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:21:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2018-11-23 11:21:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:21:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2018-11-23 11:21:29,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 159 transitions. [2018-11-23 11:21:29,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:29,470 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:21:29,470 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:21:29,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:21:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:21:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-11-23 11:21:29,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:29,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:29,538 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:29,538 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:29,546 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2018-11-23 11:21:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2018-11-23 11:21:29,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:29,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:29,549 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 88 states. [2018-11-23 11:21:29,549 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 88 states. [2018-11-23 11:21:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:29,556 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2018-11-23 11:21:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2018-11-23 11:21:29,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:29,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:29,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:29,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:21:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 11:21:29,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2018-11-23 11:21:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:29,561 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 11:21:29,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:21:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 11:21:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:21:29,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:29,563 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:21:29,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:29,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1300984299, now seen corresponding path program 1 times [2018-11-23 11:21:29,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:29,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:29,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:30,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:21:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:21:30,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:30,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:30,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:30,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-23 11:21:30,122 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:30,122 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem19.base| .cse0) (not (= (_ bv0 32) .cse0)))) [2018-11-23 11:21:30,122 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem19.base| (_ bv0 32))) [2018-11-23 11:21:30,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {1675#true} call ULTIMATE.init(); {1675#true} is VALID [2018-11-23 11:21:30,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {1675#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1675#true} is VALID [2018-11-23 11:21:30,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {1675#true} assume true; {1675#true} is VALID [2018-11-23 11:21:30,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1675#true} {1675#true} #161#return; {1675#true} is VALID [2018-11-23 11:21:30,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {1675#true} call #t~ret22 := main(); {1675#true} is VALID [2018-11-23 11:21:30,299 INFO L256 TraceCheckUtils]: 5: Hoare triple {1675#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {1675#true} is VALID [2018-11-23 11:21:30,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {1675#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1675#true} is VALID [2018-11-23 11:21:30,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {1675#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1675#true} is VALID [2018-11-23 11:21:30,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {1675#true} #res := ~len~1; {1675#true} is VALID [2018-11-23 11:21:30,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {1675#true} assume true; {1675#true} is VALID [2018-11-23 11:21:30,300 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1675#true} {1675#true} #143#return; {1675#true} is VALID [2018-11-23 11:21:30,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {1675#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1675#true} is VALID [2018-11-23 11:21:30,301 INFO L256 TraceCheckUtils]: 12: Hoare triple {1675#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {1675#true} is VALID [2018-11-23 11:21:30,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {1675#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1675#true} is VALID [2018-11-23 11:21:30,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {1675#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1675#true} is VALID [2018-11-23 11:21:30,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {1675#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:21:30,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:21:30,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:30,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:30,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:30,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-23 11:21:30,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-23 11:21:30,309 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} {1675#true} #145#return; {1749#(not (= (_ bv0 32) |main_#t~ret14.base|))} is VALID [2018-11-23 11:21:30,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {1749#(not (= (_ bv0 32) |main_#t~ret14.base|))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:30,315 INFO L256 TraceCheckUtils]: 24: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:30,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:30,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:30,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} #res := ~len~1; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:30,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} assume true; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:30,321 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #147#return; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:30,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:30,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:30,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1782#(not (= |main_#t~mem19.base| (_ bv0 32)))} is VALID [2018-11-23 11:21:30,324 INFO L256 TraceCheckUtils]: 33: Hoare triple {1782#(not (= |main_#t~mem19.base| (_ bv0 32)))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {1675#true} is VALID [2018-11-23 11:21:30,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {1675#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1789#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:30,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {1789#(= sll_length_~head.base |sll_length_#in~head.base|)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:30,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} #res := ~len~0; {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:30,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} assume true; {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:30,329 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} {1782#(not (= |main_#t~mem19.base| (_ bv0 32)))} #153#return; {1676#false} is VALID [2018-11-23 11:21:30,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {1676#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {1676#false} is VALID [2018-11-23 11:21:30,329 INFO L273 TraceCheckUtils]: 40: Hoare triple {1676#false} assume !false; {1676#false} is VALID [2018-11-23 11:21:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:30,333 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:30,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:21:30,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 11:21:30,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:30,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:21:30,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:30,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:21:30,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:21:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:21:30,457 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 11 states. [2018-11-23 11:21:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:58,622 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-23 11:21:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:21:58,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 11:21:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:21:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2018-11-23 11:21:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:21:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2018-11-23 11:21:58,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2018-11-23 11:21:59,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:59,035 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:21:59,036 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:21:59,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:21:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:21:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2018-11-23 11:21:59,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:59,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 65 states. [2018-11-23 11:21:59,119 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 65 states. [2018-11-23 11:21:59,119 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 65 states. [2018-11-23 11:21:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:59,123 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-23 11:21:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-11-23 11:21:59,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:59,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:59,124 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 82 states. [2018-11-23 11:21:59,125 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 82 states. [2018-11-23 11:21:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:59,129 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-23 11:21:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-11-23 11:21:59,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:59,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:59,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:59,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:21:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-23 11:21:59,133 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 41 [2018-11-23 11:21:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:59,133 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-23 11:21:59,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:21:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 11:21:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:21:59,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:59,135 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:21:59,135 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:59,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1019856888, now seen corresponding path program 1 times [2018-11-23 11:21:59,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:59,136 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:59,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:59,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:59,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {2200#true} call ULTIMATE.init(); {2200#true} is VALID [2018-11-23 11:21:59,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {2200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2200#true} is VALID [2018-11-23 11:21:59,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:21:59,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2200#true} {2200#true} #161#return; {2200#true} is VALID [2018-11-23 11:21:59,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {2200#true} call #t~ret22 := main(); {2200#true} is VALID [2018-11-23 11:21:59,476 INFO L256 TraceCheckUtils]: 5: Hoare triple {2200#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {2200#true} is VALID [2018-11-23 11:21:59,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:59,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:59,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:59,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:59,481 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {2200#true} #143#return; {2237#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:59,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {2237#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:59,481 INFO L256 TraceCheckUtils]: 12: Hoare triple {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {2200#true} is VALID [2018-11-23 11:21:59,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2248#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:21:59,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {2248#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:21:59,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:21:59,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:21:59,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:21:59,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2265#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} is VALID [2018-11-23 11:21:59,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {2265#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:21:59,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:21:59,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:21:59,504 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {2201#false} is VALID [2018-11-23 11:21:59,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {2201#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {2201#false} is VALID [2018-11-23 11:21:59,504 INFO L256 TraceCheckUtils]: 24: Hoare triple {2201#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {2201#false} is VALID [2018-11-23 11:21:59,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {2201#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2201#false} is VALID [2018-11-23 11:21:59,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {2201#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2201#false} is VALID [2018-11-23 11:21:59,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {2201#false} #res := ~len~1; {2201#false} is VALID [2018-11-23 11:21:59,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {2201#false} assume true; {2201#false} is VALID [2018-11-23 11:21:59,505 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2201#false} {2201#false} #147#return; {2201#false} is VALID [2018-11-23 11:21:59,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {2201#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:21:59,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {2201#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {2201#false} is VALID [2018-11-23 11:21:59,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {2201#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2201#false} is VALID [2018-11-23 11:21:59,506 INFO L256 TraceCheckUtils]: 33: Hoare triple {2201#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2201#false} is VALID [2018-11-23 11:21:59,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {2201#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:21:59,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {2201#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2201#false} is VALID [2018-11-23 11:21:59,507 INFO L273 TraceCheckUtils]: 36: Hoare triple {2201#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2201#false} is VALID [2018-11-23 11:21:59,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {2201#false} #res := ~len~0; {2201#false} is VALID [2018-11-23 11:21:59,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {2201#false} assume true; {2201#false} is VALID [2018-11-23 11:21:59,508 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2201#false} {2201#false} #153#return; {2201#false} is VALID [2018-11-23 11:21:59,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {2201#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {2201#false} is VALID [2018-11-23 11:21:59,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2018-11-23 11:21:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:21:59,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:00,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2018-11-23 11:22:00,118 INFO L273 TraceCheckUtils]: 40: Hoare triple {2201#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {2201#false} is VALID [2018-11-23 11:22:00,119 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2200#true} {2201#false} #153#return; {2201#false} is VALID [2018-11-23 11:22:00,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:00,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {2200#true} #res := ~len~0; {2200#true} is VALID [2018-11-23 11:22:00,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {2200#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2200#true} is VALID [2018-11-23 11:22:00,120 INFO L273 TraceCheckUtils]: 35: Hoare triple {2200#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2200#true} is VALID [2018-11-23 11:22:00,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {2200#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2200#true} is VALID [2018-11-23 11:22:00,120 INFO L256 TraceCheckUtils]: 33: Hoare triple {2201#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {2200#true} is VALID [2018-11-23 11:22:00,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {2201#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2201#false} is VALID [2018-11-23 11:22:00,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {2201#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {2201#false} is VALID [2018-11-23 11:22:00,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {2201#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:22:00,121 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2200#true} {2201#false} #147#return; {2201#false} is VALID [2018-11-23 11:22:00,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:00,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {2200#true} #res := ~len~1; {2200#true} is VALID [2018-11-23 11:22:00,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {2200#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2200#true} is VALID [2018-11-23 11:22:00,122 INFO L273 TraceCheckUtils]: 25: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2200#true} is VALID [2018-11-23 11:22:00,122 INFO L256 TraceCheckUtils]: 24: Hoare triple {2201#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {2200#true} is VALID [2018-11-23 11:22:00,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {2201#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {2201#false} is VALID [2018-11-23 11:22:00,140 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} #145#return; {2201#false} is VALID [2018-11-23 11:22:00,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:00,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:00,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {2406#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:00,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2406#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:00,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:00,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:00,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:00,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {2423#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:00,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2423#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:00,185 INFO L256 TraceCheckUtils]: 12: Hoare triple {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {2200#true} is VALID [2018-11-23 11:22:00,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {2430#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:00,188 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} {2200#true} #143#return; {2430#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:00,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume true; {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:00,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} #res := ~len~1; {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:00,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:00,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:00,193 INFO L256 TraceCheckUtils]: 5: Hoare triple {2200#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {2200#true} is VALID [2018-11-23 11:22:00,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {2200#true} call #t~ret22 := main(); {2200#true} is VALID [2018-11-23 11:22:00,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2200#true} {2200#true} #161#return; {2200#true} is VALID [2018-11-23 11:22:00,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:00,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {2200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2200#true} is VALID [2018-11-23 11:22:00,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {2200#true} call ULTIMATE.init(); {2200#true} is VALID [2018-11-23 11:22:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:00,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:00,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 11:22:00,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-23 11:22:00,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:00,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:22:00,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:22:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:22:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:22:00,318 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 17 states. [2018-11-23 11:22:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:03,854 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2018-11-23 11:22:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:22:03,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-23 11:22:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:22:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2018-11-23 11:22:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:22:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2018-11-23 11:22:03,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 176 transitions. [2018-11-23 11:22:04,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:04,211 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:22:04,211 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:22:04,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:22:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:22:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2018-11-23 11:22:04,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:04,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:04,388 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:04,388 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:04,396 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2018-11-23 11:22:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2018-11-23 11:22:04,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:04,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:04,397 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 133 states. [2018-11-23 11:22:04,397 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 133 states. [2018-11-23 11:22:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:04,405 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2018-11-23 11:22:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2018-11-23 11:22:04,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:04,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:04,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:04,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:22:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-11-23 11:22:04,411 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 42 [2018-11-23 11:22:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:04,411 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-11-23 11:22:04,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:22:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-23 11:22:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:22:04,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:04,413 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:22:04,413 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:04,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 725675112, now seen corresponding path program 1 times [2018-11-23 11:22:04,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:04,414 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:04,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:04,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:04,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {3109#true} call ULTIMATE.init(); {3109#true} is VALID [2018-11-23 11:22:04,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {3109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3109#true} is VALID [2018-11-23 11:22:04,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:04,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3109#true} {3109#true} #161#return; {3109#true} is VALID [2018-11-23 11:22:04,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {3109#true} call #t~ret22 := main(); {3109#true} is VALID [2018-11-23 11:22:04,819 INFO L256 TraceCheckUtils]: 5: Hoare triple {3109#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {3109#true} is VALID [2018-11-23 11:22:04,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3132#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {3132#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3136#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {3136#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} #res := ~len~1; {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} assume true; {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:04,848 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} {3109#true} #143#return; {3154#(= (bvadd |main_#t~ret13| (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:04,848 INFO L273 TraceCheckUtils]: 13: Hoare triple {3154#(= (bvadd |main_#t~ret13| (_ bv4294967292 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:04,849 INFO L256 TraceCheckUtils]: 14: Hoare triple {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {3109#true} is VALID [2018-11-23 11:22:04,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {3109#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3165#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:22:04,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {3165#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:04,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:04,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:04,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:04,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3182#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} is VALID [2018-11-23 11:22:04,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {3182#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:04,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:04,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:04,872 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} #145#return; {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {3110#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L256 TraceCheckUtils]: 26: Hoare triple {3110#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {3110#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {3110#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {3110#false} #res := ~len~1; {3110#false} is VALID [2018-11-23 11:22:04,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {3110#false} assume true; {3110#false} is VALID [2018-11-23 11:22:04,874 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3110#false} {3110#false} #147#return; {3110#false} is VALID [2018-11-23 11:22:04,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {3110#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:04,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {3110#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {3110#false} is VALID [2018-11-23 11:22:04,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {3110#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {3110#false} is VALID [2018-11-23 11:22:04,874 INFO L256 TraceCheckUtils]: 35: Hoare triple {3110#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {3110#false} is VALID [2018-11-23 11:22:04,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {3110#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:04,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {3110#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3110#false} is VALID [2018-11-23 11:22:04,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {3110#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3110#false} is VALID [2018-11-23 11:22:04,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {3110#false} #res := ~len~0; {3110#false} is VALID [2018-11-23 11:22:04,875 INFO L273 TraceCheckUtils]: 40: Hoare triple {3110#false} assume true; {3110#false} is VALID [2018-11-23 11:22:04,876 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3110#false} {3110#false} #153#return; {3110#false} is VALID [2018-11-23 11:22:04,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {3110#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {3110#false} is VALID [2018-11-23 11:22:04,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {3110#false} assume !false; {3110#false} is VALID [2018-11-23 11:22:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:22:04,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:05,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {3110#false} assume !false; {3110#false} is VALID [2018-11-23 11:22:05,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {3110#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {3110#false} is VALID [2018-11-23 11:22:05,674 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3109#true} {3110#false} #153#return; {3110#false} is VALID [2018-11-23 11:22:05,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:05,675 INFO L273 TraceCheckUtils]: 39: Hoare triple {3109#true} #res := ~len~0; {3109#true} is VALID [2018-11-23 11:22:05,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {3109#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3109#true} is VALID [2018-11-23 11:22:05,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {3109#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3109#true} is VALID [2018-11-23 11:22:05,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {3109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3109#true} is VALID [2018-11-23 11:22:05,676 INFO L256 TraceCheckUtils]: 35: Hoare triple {3110#false} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {3109#true} is VALID [2018-11-23 11:22:05,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {3110#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {3110#false} is VALID [2018-11-23 11:22:05,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {3110#false} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {3110#false} is VALID [2018-11-23 11:22:05,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {3110#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:05,677 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3109#true} {3110#false} #147#return; {3110#false} is VALID [2018-11-23 11:22:05,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:05,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {3109#true} #res := ~len~1; {3109#true} is VALID [2018-11-23 11:22:05,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {3109#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3109#true} is VALID [2018-11-23 11:22:05,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3109#true} is VALID [2018-11-23 11:22:05,678 INFO L256 TraceCheckUtils]: 26: Hoare triple {3110#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {3109#true} is VALID [2018-11-23 11:22:05,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {3110#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {3110#false} is VALID [2018-11-23 11:22:05,679 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} #145#return; {3110#false} is VALID [2018-11-23 11:22:05,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:05,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:05,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {3323#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:05,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3323#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:05,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:05,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:05,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:05,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {3340#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:05,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {3109#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3340#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:05,693 INFO L256 TraceCheckUtils]: 14: Hoare triple {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {3109#true} is VALID [2018-11-23 11:22:05,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {3347#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:05,695 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} {3109#true} #143#return; {3347#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:05,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume true; {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:05,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} #res := ~len~1; {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:05,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:05,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {3368#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:05,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {3372#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3368#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:22:05,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3372#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:05,703 INFO L256 TraceCheckUtils]: 5: Hoare triple {3109#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {3109#true} is VALID [2018-11-23 11:22:05,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {3109#true} call #t~ret22 := main(); {3109#true} is VALID [2018-11-23 11:22:05,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3109#true} {3109#true} #161#return; {3109#true} is VALID [2018-11-23 11:22:05,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:05,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {3109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3109#true} is VALID [2018-11-23 11:22:05,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {3109#true} call ULTIMATE.init(); {3109#true} is VALID [2018-11-23 11:22:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:05,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:05,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 11:22:05,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 11:22:05,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:05,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:22:05,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:22:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:22:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:22:05,906 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 21 states. [2018-11-23 11:22:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:13,828 INFO L93 Difference]: Finished difference Result 188 states and 252 transitions. [2018-11-23 11:22:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:22:13,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 11:22:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:22:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 175 transitions. [2018-11-23 11:22:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:22:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 175 transitions. [2018-11-23 11:22:13,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 175 transitions. [2018-11-23 11:22:14,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:14,312 INFO L225 Difference]: With dead ends: 188 [2018-11-23 11:22:14,312 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:22:14,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:22:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:22:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 69. [2018-11-23 11:22:14,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:14,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:14,565 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:14,565 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:14,571 INFO L93 Difference]: Finished difference Result 133 states and 185 transitions. [2018-11-23 11:22:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2018-11-23 11:22:14,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:14,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:14,573 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 133 states. [2018-11-23 11:22:14,573 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 133 states. [2018-11-23 11:22:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:14,580 INFO L93 Difference]: Finished difference Result 133 states and 185 transitions. [2018-11-23 11:22:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2018-11-23 11:22:14,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:14,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:14,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:14,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:22:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-11-23 11:22:14,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 44 [2018-11-23 11:22:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-23 11:22:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:22:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 11:22:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:22:14,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:14,586 INFO L402 BasicCegarLoop]: trace histogram [3, 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-11-23 11:22:14,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:14,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash -319300561, now seen corresponding path program 2 times [2018-11-23 11:22:14,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:14,611 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:22:14,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:22:14,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:14,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:14,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:22:14,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-23 11:22:14,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:14,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:14,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:14,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 11:22:14,921 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:14,922 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, v_sll_create_~head~0.base_21]. (and (not (= (_ bv0 32) v_sll_create_~head~0.base_21)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_34| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_34| sll_create_~head~0.base) (_ bv0 32) v_sll_create_~head~0.base_21))) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:22:14,922 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:22:15,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:22:15,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:22:15,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:15,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:15,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:15,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-11-23 11:22:15,270 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:15,271 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem19.base| .cse0) (= .cse1 |main_#t~mem19.offset|) (= .cse1 (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32))))) [2018-11-23 11:22:15,271 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem19.base| .cse0) (not (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~mem19.offset|))) [2018-11-23 11:22:15,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {4043#true} call ULTIMATE.init(); {4043#true} is VALID [2018-11-23 11:22:15,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {4043#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4043#true} is VALID [2018-11-23 11:22:15,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4043#true} {4043#true} #161#return; {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {4043#true} call #t~ret22 := main(); {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L256 TraceCheckUtils]: 5: Hoare triple {4043#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:15,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:15,763 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4043#true} {4043#true} #143#return; {4043#true} is VALID [2018-11-23 11:22:15,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {4043#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4043#true} is VALID [2018-11-23 11:22:15,763 INFO L256 TraceCheckUtils]: 12: Hoare triple {4043#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4043#true} is VALID [2018-11-23 11:22:15,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {4043#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4043#true} is VALID [2018-11-23 11:22:15,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {4043#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4043#true} is VALID [2018-11-23 11:22:15,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {4043#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:15,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:15,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:15,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:15,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:22:15,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:22:15,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:15,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:15,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:15,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:15,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:15,783 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} {4043#true} #145#return; {4131#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|))} is VALID [2018-11-23 11:22:15,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {4131#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:15,787 INFO L256 TraceCheckUtils]: 28: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} #res := ~len~1; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} assume true; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,791 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} #147#return; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:15,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:15,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:15,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= (_ bv0 32) |main_#t~mem19.offset|))} is VALID [2018-11-23 11:22:15,797 INFO L256 TraceCheckUtils]: 37: Hoare triple {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= (_ bv0 32) |main_#t~mem19.offset|))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {4168#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:15,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {4168#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4172#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {4172#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4176#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {4176#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} #res := ~len~0; {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume true; {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:15,804 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= (_ bv0 32) |main_#t~mem19.offset|))} #153#return; {4044#false} is VALID [2018-11-23 11:22:15,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {4044#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {4044#false} is VALID [2018-11-23 11:22:15,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2018-11-23 11:22:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:15,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:16,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 11:22:16,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 11:22:16,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:16,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:16,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:16,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:21 [2018-11-23 11:22:16,331 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:16,332 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.offset|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 |main_#t~ret14.offset|)) (not (= .cse1 |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.base| .cse1) .cse0) (_ bv0 32))))) [2018-11-23 11:22:16,332 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) |main_#t~ret14.offset|))))) [2018-11-23 11:22:17,047 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-11-23 11:22:17,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 11:22:17,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:22:17,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:17,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:17,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 11:22:17,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:22:17,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:17,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:17,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:17,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:14 [2018-11-23 11:22:17,113 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:17,113 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse1 (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (let ((.cse0 (select (select .cse1 |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 sll_create_~new_head~0.base)) (not (= (select (select .cse1 .cse0) sll_create_~new_head~0.offset) (_ bv0 32)))))) [2018-11-23 11:22:17,113 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (not (= sll_create_~head~0.base (_ bv0 32))))) (and (or .cse0 (not (= sll_create_~head~0.base sll_create_~new_head~0.base))) .cse0)) [2018-11-23 11:22:17,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2018-11-23 11:22:17,141 INFO L273 TraceCheckUtils]: 44: Hoare triple {4044#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {4044#false} is VALID [2018-11-23 11:22:17,142 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} {4202#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} #153#return; {4044#false} is VALID [2018-11-23 11:22:17,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} assume true; {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:17,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} #res := ~len~0; {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:17,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {4216#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:17,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {4220#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4216#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} is VALID [2018-11-23 11:22:17,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {4043#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4220#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:22:17,145 INFO L256 TraceCheckUtils]: 37: Hoare triple {4202#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {4043#true} is VALID [2018-11-23 11:22:17,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4202#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)))} is VALID [2018-11-23 11:22:17,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:17,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:17,186 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4043#true} {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} #147#return; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:17,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:17,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:17,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:17,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:17,187 INFO L256 TraceCheckUtils]: 28: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4043#true} is VALID [2018-11-23 11:22:17,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {4255#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret14.offset|)))))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:17,217 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} {4043#true} #145#return; {4255#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret14.offset|)))))} is VALID [2018-11-23 11:22:17,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} assume true; {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} is VALID [2018-11-23 11:22:17,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} is VALID [2018-11-23 11:22:17,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:17,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:17,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:17,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:17,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:17,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:17,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:17,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:17,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {4043#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:17,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {4043#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4043#true} is VALID [2018-11-23 11:22:17,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {4043#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4043#true} is VALID [2018-11-23 11:22:17,358 INFO L256 TraceCheckUtils]: 12: Hoare triple {4043#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4043#true} is VALID [2018-11-23 11:22:17,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {4043#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4043#true} is VALID [2018-11-23 11:22:17,358 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4043#true} {4043#true} #143#return; {4043#true} is VALID [2018-11-23 11:22:17,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:17,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:17,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:17,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:17,359 INFO L256 TraceCheckUtils]: 5: Hoare triple {4043#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4043#true} is VALID [2018-11-23 11:22:17,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {4043#true} call #t~ret22 := main(); {4043#true} is VALID [2018-11-23 11:22:17,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4043#true} {4043#true} #161#return; {4043#true} is VALID [2018-11-23 11:22:17,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:17,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {4043#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4043#true} is VALID [2018-11-23 11:22:17,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {4043#true} call ULTIMATE.init(); {4043#true} is VALID [2018-11-23 11:22:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:22:17,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:17,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-11-23 11:22:17,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-11-23 11:22:17,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:17,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:22:17,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:17,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:22:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:22:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:22:17,839 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 23 states. [2018-11-23 11:22:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:48,674 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-23 11:22:48,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:22:48,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-11-23 11:22:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:22:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 11:22:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:22:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 11:22:48,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2018-11-23 11:22:48,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:48,910 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:22:48,910 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:22:48,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:22:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:22:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2018-11-23 11:22:49,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:49,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:49,039 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:49,040 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:49,044 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 11:22:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-23 11:22:49,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:49,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:49,045 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 91 states. [2018-11-23 11:22:49,045 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 91 states. [2018-11-23 11:22:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:49,048 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 11:22:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-23 11:22:49,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:49,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:49,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:49,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:22:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-23 11:22:49,052 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2018-11-23 11:22:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:49,052 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-23 11:22:49,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:22:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:22:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:22:49,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:49,054 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:22:49,054 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:49,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 290920004, now seen corresponding path program 3 times [2018-11-23 11:22:49,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:49,081 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:22:49,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:22:49,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:49,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:49,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {4775#true} call ULTIMATE.init(); {4775#true} is VALID [2018-11-23 11:22:49,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {4775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4775#true} is VALID [2018-11-23 11:22:49,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:49,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4775#true} {4775#true} #161#return; {4775#true} is VALID [2018-11-23 11:22:49,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {4775#true} call #t~ret22 := main(); {4775#true} is VALID [2018-11-23 11:22:49,404 INFO L256 TraceCheckUtils]: 5: Hoare triple {4775#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4775#true} is VALID [2018-11-23 11:22:49,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,407 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {4775#true} #143#return; {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,407 INFO L256 TraceCheckUtils]: 12: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4775#true} is VALID [2018-11-23 11:22:49,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {4775#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4775#true} is VALID [2018-11-23 11:22:49,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:49,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:49,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:49,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:49,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:49,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:49,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:49,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:49,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:49,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {4775#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4775#true} is VALID [2018-11-23 11:22:49,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4775#true} is VALID [2018-11-23 11:22:49,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:49,411 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4775#true} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,412 INFO L256 TraceCheckUtils]: 28: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4775#true} is VALID [2018-11-23 11:22:49,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:49,414 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #147#return; {4883#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret15| (_ bv0 32)))} is VALID [2018-11-23 11:22:49,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {4883#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret15| (_ bv0 32)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:49,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:49,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:49,417 INFO L256 TraceCheckUtils]: 37: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {4775#true} is VALID [2018-11-23 11:22:49,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {4775#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4900#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:22:49,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {4900#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:49,421 INFO L273 TraceCheckUtils]: 42: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:49,422 INFO L273 TraceCheckUtils]: 43: Hoare triple {4915#(= (_ bv2 32) |sll_length_#res|)} assume true; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:49,423 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4915#(= (_ bv2 32) |sll_length_#res|)} {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} #153#return; {4922#(and (= (bvadd |main_#t~ret20| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:49,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {4922#(and (= (bvadd |main_#t~ret20| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {4776#false} is VALID [2018-11-23 11:22:49,424 INFO L273 TraceCheckUtils]: 46: Hoare triple {4776#false} assume !false; {4776#false} is VALID [2018-11-23 11:22:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:22:49,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:50,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {4776#false} assume !false; {4776#false} is VALID [2018-11-23 11:22:50,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {4932#(= (bvadd main_~len~2 main_~k~0) |main_#t~ret20|)} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {4776#false} is VALID [2018-11-23 11:22:50,153 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4915#(= (_ bv2 32) |sll_length_#res|)} {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} #153#return; {4932#(= (bvadd main_~len~2 main_~k~0) |main_#t~ret20|)} is VALID [2018-11-23 11:22:50,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {4915#(= (_ bv2 32) |sll_length_#res|)} assume true; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:50,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:50,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,156 INFO L273 TraceCheckUtils]: 39: Hoare triple {4900#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {4775#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4900#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:22:50,157 INFO L256 TraceCheckUtils]: 37: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {4775#true} is VALID [2018-11-23 11:22:50,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {4967#(= (_ bv2 32) (bvadd |main_#t~ret15| main_~len~2))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,175 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #147#return; {4967#(= (_ bv2 32) (bvadd |main_#t~ret15| main_~len~2))} is VALID [2018-11-23 11:22:50,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} assume true; {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:50,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} #res := ~len~1; {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:50,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:22:50,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:22:50,178 INFO L256 TraceCheckUtils]: 28: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4775#true} is VALID [2018-11-23 11:22:50,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,180 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4775#true} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:50,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4775#true} is VALID [2018-11-23 11:22:50,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {4775#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4775#true} is VALID [2018-11-23 11:22:50,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:50,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:50,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:50,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:50,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:50,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:50,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:50,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:50,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:50,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {4775#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4775#true} is VALID [2018-11-23 11:22:50,183 INFO L256 TraceCheckUtils]: 12: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4775#true} is VALID [2018-11-23 11:22:50,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,185 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} {4775#true} #143#return; {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:50,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} assume true; {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} is VALID [2018-11-23 11:22:50,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} #res := ~len~1; {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} is VALID [2018-11-23 11:22:50,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:22:50,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:22:50,191 INFO L256 TraceCheckUtils]: 5: Hoare triple {4775#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4775#true} is VALID [2018-11-23 11:22:50,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {4775#true} call #t~ret22 := main(); {4775#true} is VALID [2018-11-23 11:22:50,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4775#true} {4775#true} #161#return; {4775#true} is VALID [2018-11-23 11:22:50,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:50,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {4775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4775#true} is VALID [2018-11-23 11:22:50,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {4775#true} call ULTIMATE.init(); {4775#true} is VALID [2018-11-23 11:22:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:22:50,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:50,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-11-23 11:22:50,198 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:22:50,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:50,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:22:50,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:50,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:22:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:22:50,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:22:50,278 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 20 states. [2018-11-23 11:22:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,292 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2018-11-23 11:22:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:22:55,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:22:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:22:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:22:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:22:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:22:55,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-23 11:22:55,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:55,553 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:22:55,553 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:22:55,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:22:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:22:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2018-11-23 11:22:55,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:55,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 104 states. [2018-11-23 11:22:55,783 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 104 states. [2018-11-23 11:22:55,783 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 104 states. [2018-11-23 11:22:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,790 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-23 11:22:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2018-11-23 11:22:55,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:55,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:55,791 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 133 states. [2018-11-23 11:22:55,791 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 133 states. [2018-11-23 11:22:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:55,798 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-23 11:22:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2018-11-23 11:22:55,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:55,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:55,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:55,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:22:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2018-11-23 11:22:55,804 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 47 [2018-11-23 11:22:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:55,804 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2018-11-23 11:22:55,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:22:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:22:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:22:55,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:55,806 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-23 11:22:55,806 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:55,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2027888335, now seen corresponding path program 4 times [2018-11-23 11:22:55,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:55,839 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:22:55,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:22:55,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:56,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:56,255 INFO L478 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 6 treesize of output 5 [2018-11-23 11:22:56,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 11:22:56,275 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:56,275 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_68|]. (and (= |#valid| (store |v_#valid_68| sll_create_~new_head~0.base (_ bv1 1))) (= sll_create_~new_head~0.offset (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32))) [2018-11-23 11:22:56,276 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (= sll_create_~head~0.base (_ bv0 32))) [2018-11-23 11:22:56,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:22:56,339 INFO L478 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-11-23 11:22:56,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:22:56,372 INFO L478 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-11-23 11:22:56,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-23 11:22:56,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:56,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:56,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:22:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-11-23 11:22:56,467 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:56,468 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_69|]. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_69| sll_create_~new_head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv1 1) (select |v_#valid_69| sll_create_~head~0.base))) [2018-11-23 11:22:56,468 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))) [2018-11-23 11:22:56,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 11:22:56,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-23 11:22:56,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 11:22:56,616 INFO L478 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-11-23 11:22:56,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:56,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-23 11:22:58,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {5698#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #161#return; {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret22 := main(); {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L256 TraceCheckUtils]: 5: Hoare triple {5698#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:22:58,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:22:58,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:22:58,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:22:58,525 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5698#true} {5698#true} #143#return; {5698#true} is VALID [2018-11-23 11:22:58,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {5698#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {5698#true} is VALID [2018-11-23 11:22:58,525 INFO L256 TraceCheckUtils]: 12: Hoare triple {5698#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {5698#true} is VALID [2018-11-23 11:22:58,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {5698#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:58,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:58,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:58,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:58,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:58,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:58,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-23 11:22:58,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-23 11:22:58,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} assume true; {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,543 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} {5698#true} #145#return; {5787#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) |main_#t~ret14.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:58,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {5787#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) |main_#t~ret14.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32)))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,548 INFO L256 TraceCheckUtils]: 28: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} #res := ~len~1; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} assume true; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,551 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} #147#return; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,552 INFO L273 TraceCheckUtils]: 35: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:58,558 INFO L256 TraceCheckUtils]: 37: Hoare triple {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:58,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5827#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-23 11:22:58,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {5827#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5831#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-23 11:22:58,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {5831#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5835#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-23 11:22:58,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {5835#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:58,567 INFO L273 TraceCheckUtils]: 42: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:58,568 INFO L273 TraceCheckUtils]: 43: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} #res := ~len~0; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:58,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume true; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:58,573 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem19.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} #153#return; {5699#false} is VALID [2018-11-23 11:22:58,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {5699#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {5699#false} is VALID [2018-11-23 11:22:58,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2018-11-23 11:22:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:58,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:00,051 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:23:00,390 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:23:00,764 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:23:01,158 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:23:05,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 215 [2018-11-23 11:23:05,564 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2018-11-23 11:23:05,571 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:05,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:05,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:05,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 11:23:05,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:05,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 11:23:05,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:05,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 78 [2018-11-23 11:23:05,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:06,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-11-23 11:23:06,113 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-11-23 11:23:06,220 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 11:23:06,348 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:06,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:06,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 215 [2018-11-23 11:23:07,459 WARN L180 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-23 11:23:07,475 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:07,477 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:07,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:07,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2018-11-23 11:23:07,754 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:07,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-11-23 11:23:07,902 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 11:23:08,052 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:08,147 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:08,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:08,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-11-23 11:23:08,211 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 11:23:08,387 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:08,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-11-23 11:23:08,531 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,619 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:08,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-23 11:23:08,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:08,636 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,661 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:08,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2018-11-23 11:23:08,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-11-23 11:23:08,689 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:08,738 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:09,059 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 16 xjuncts. [2018-11-23 11:23:09,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 74 [2018-11-23 11:23:10,231 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-23 11:23:10,241 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:10,242 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:10,364 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:10,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:10,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 87 [2018-11-23 11:23:10,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2018-11-23 11:23:10,496 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:10,667 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:10,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 11:23:10,670 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:10,812 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:10,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2018-11-23 11:23:10,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2018-11-23 11:23:10,872 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:10,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:23:10,945 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:10,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:23:11,001 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 11:23:11,050 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,075 INFO L267 ElimStorePlain]: Start of recursive call 31: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,129 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:11,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:11,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 77 [2018-11-23 11:23:11,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-23 11:23:11,267 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 11:23:11,484 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:11,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 11:23:11,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:11,668 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:11,695 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,709 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 11:23:11,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:11,745 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:11,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:11,786 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:11,808 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:11,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2018-11-23 11:23:11,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 11:23:11,983 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:12,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:12,078 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:12,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:12,176 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:12,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:23:12,236 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:12,317 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:12,352 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:12,374 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:12,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:12,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 94 [2018-11-23 11:23:12,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-23 11:23:12,626 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:13,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:23:13,832 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:14,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 11:23:14,465 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:15,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 11:23:15,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 11:23:15,809 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:15,849 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:16,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-11-23 11:23:16,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:16,468 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:16,515 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:16,549 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,570 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:17,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 11:23:18,024 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-23 11:23:18,043 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:18,044 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:18,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:23:18,049 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:23:18,251 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 26 [2018-11-23 11:23:18,545 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:18,739 INFO L267 ElimStorePlain]: Start of recursive call 60: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:18,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-23 11:23:18,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 11:23:18,986 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:19,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:23:19,127 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:19,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:23:19,284 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:19,367 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:19,480 INFO L267 ElimStorePlain]: Start of recursive call 50: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:19,494 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:19,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:19,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 77 [2018-11-23 11:23:19,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-11-23 11:23:19,620 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:19,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:19,801 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-23 11:23:20,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,100 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,139 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:20,166 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,180 INFO L267 ElimStorePlain]: Start of recursive call 71: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 11:23:20,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,303 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:23:20,339 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,350 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,406 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:20,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 11:23:20,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:23:20,490 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,536 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-11-23 11:23:20,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:20,558 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,589 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:20,610 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,619 INFO L267 ElimStorePlain]: Start of recursive call 80: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,633 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,646 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:20,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2018-11-23 11:23:20,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:20,687 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 11:23:20,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,725 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,736 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,739 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,751 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:20,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-11-23 11:23:20,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:20,802 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 11:23:20,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:23:20,851 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:20,867 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,870 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,880 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,904 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:21,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 94 [2018-11-23 11:23:21,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-23 11:23:21,208 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:23:22,220 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 11:23:22,796 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 11:23:23,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 11:23:23,931 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:23,968 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:24,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:24,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 54 [2018-11-23 11:23:24,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 11:23:24,628 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:24,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2018-11-23 11:23:24,862 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:25,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 11:23:25,031 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:25,130 INFO L267 ElimStorePlain]: Start of recursive call 100: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:25,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 11:23:26,182 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-11-23 11:23:26,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-23 11:23:26,194 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 11:23:26,435 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:23:26,580 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 11:23:26,795 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,909 INFO L267 ElimStorePlain]: Start of recursive call 104: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:27,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 11:23:28,254 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-11-23 11:23:28,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:28,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:28,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:23:28,267 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:23:28,489 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:28,680 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:28,854 INFO L267 ElimStorePlain]: Start of recursive call 109: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:28,920 INFO L267 ElimStorePlain]: Start of recursive call 94: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,989 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:29,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 78 [2018-11-23 11:23:29,251 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-11-23 11:23:29,261 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:29,262 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:29,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 11:23:29,474 INFO L478 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 59 treesize of output 58 [2018-11-23 11:23:29,476 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,610 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:29,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 11:23:29,614 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:29,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2018-11-23 11:23:29,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 11:23:29,837 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:30,039 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:30,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 11:23:30,191 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 11:23:30,333 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,474 INFO L267 ElimStorePlain]: Start of recursive call 118: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:30,614 INFO L267 ElimStorePlain]: Start of recursive call 115: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:30,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:30,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:23:30,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 55 [2018-11-23 11:23:30,888 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:31,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:31,723 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:32,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:23:32,554 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:33,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:23:33,337 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 11:23:34,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:34,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 11:23:34,136 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:34,181 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:34,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-23 11:23:34,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:34,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:34,196 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,215 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 11:23:34,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:34,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 11:23:34,985 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:35,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 11:23:35,097 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:35,156 INFO L267 ElimStorePlain]: Start of recursive call 132: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:35,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 11:23:35,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 11:23:35,729 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:35,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 11:23:35,877 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:35,971 INFO L267 ElimStorePlain]: Start of recursive call 135: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:36,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 11:23:38,190 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2018-11-23 11:23:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:23:38,207 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,721 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:38,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:23:38,748 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:39,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:23:39,406 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:39,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:39,836 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:40,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:23:40,137 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 11:23:40,634 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 11:23:40,893 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:41,074 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:41,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 11:23:41,077 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:41,227 INFO L267 ElimStorePlain]: Start of recursive call 138: 10 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:41,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 37 [2018-11-23 11:23:41,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-23 11:23:41,577 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:41,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 11:23:41,667 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:41,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:41,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2018-11-23 11:23:41,781 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:41,848 INFO L267 ElimStorePlain]: Start of recursive call 147: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:42,055 INFO L267 ElimStorePlain]: Start of recursive call 123: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:42,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:42,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 11:23:42,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 11:23:42,153 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:42,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-11-23 11:23:42,297 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 11:23:42,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:42,425 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:42,452 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,484 INFO L267 ElimStorePlain]: Start of recursive call 154: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 11:23:42,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:42,609 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:42,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:23:42,676 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,718 INFO L267 ElimStorePlain]: Start of recursive call 157: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:42,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 56 [2018-11-23 11:23:43,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-23 11:23:43,215 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-11-23 11:23:43,668 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-23 11:23:43,819 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,898 INFO L267 ElimStorePlain]: Start of recursive call 160: 10 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,924 INFO L267 ElimStorePlain]: Start of recursive call 151: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:44,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:23:44,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-23 11:23:44,141 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:44,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 11:23:44,838 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:45,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:23:45,382 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:46,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:46,005 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:46,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-23 11:23:46,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:46,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 11:23:46,540 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:46,589 INFO L267 ElimStorePlain]: Start of recursive call 169: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:47,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 39 [2018-11-23 11:23:47,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2018-11-23 11:23:47,231 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 11:23:47,301 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:47,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:23:47,380 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:47,432 INFO L267 ElimStorePlain]: Start of recursive call 171: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:47,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 11:23:47,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:23:47,919 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:47,999 INFO L267 ElimStorePlain]: Start of recursive call 175: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:48,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 11:23:48,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:23:48,471 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 11:23:48,672 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:23:48,845 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:23:49,020 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:49,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 11:23:49,332 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 11:23:49,448 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:49,506 INFO L267 ElimStorePlain]: Start of recursive call 177: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:49,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 11:23:50,925 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2018-11-23 11:23:50,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:23:50,959 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:51,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:23:51,274 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:51,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:51,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:23:51,853 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:52,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:52,109 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:52,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:23:52,363 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:52,463 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:52,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 11:23:52,465 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:52,608 INFO L267 ElimStorePlain]: Start of recursive call 184: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:52,788 INFO L267 ElimStorePlain]: Start of recursive call 164: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:52,881 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:23:52,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 79 [2018-11-23 11:23:53,170 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-23 11:23:53,177 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:53,178 INFO L267 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:53,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 11:23:53,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 11:23:53,329 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:53,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:23:53,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 11:23:53,380 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,383 INFO L267 ElimStorePlain]: Start of recursive call 195: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,395 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:53,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 61 [2018-11-23 11:23:53,466 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:53,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-11-23 11:23:53,468 INFO L267 ElimStorePlain]: Start of recursive call 198: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,515 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:53,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 11:23:53,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:23:53,535 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:53,561 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,572 INFO L267 ElimStorePlain]: Start of recursive call 199: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,586 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:53,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 68 [2018-11-23 11:23:53,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-11-23 11:23:53,727 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:53,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-23 11:23:53,885 INFO L267 ElimStorePlain]: Start of recursive call 204: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-11-23 11:23:54,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 11:23:54,043 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:23:54,099 INFO L267 ElimStorePlain]: Start of recursive call 207: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,132 INFO L267 ElimStorePlain]: Start of recursive call 205: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:54,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 11:23:54,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 11:23:54,214 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,226 INFO L267 ElimStorePlain]: Start of recursive call 208: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,262 INFO L267 ElimStorePlain]: Start of recursive call 202: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,271 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:23:54,272 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:54,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 11:23:54,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:23:54,303 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:23:54,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:54,337 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,341 INFO L267 ElimStorePlain]: Start of recursive call 213: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,353 INFO L267 ElimStorePlain]: Start of recursive call 211: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 11:23:54,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:54,383 INFO L267 ElimStorePlain]: Start of recursive call 216: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:23:54,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:54,442 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,444 INFO L267 ElimStorePlain]: Start of recursive call 217: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,457 INFO L267 ElimStorePlain]: Start of recursive call 215: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,506 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:54,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 77 [2018-11-23 11:23:54,775 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-23 11:23:54,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:23:54,784 INFO L267 ElimStorePlain]: Start of recursive call 220: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:54,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 11:23:54,953 INFO L478 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 9 treesize of output 8 [2018-11-23 11:23:54,955 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:55,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-11-23 11:23:55,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 11:23:55,036 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 11:23:55,116 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:23:55,174 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 11:23:55,223 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-11-23 11:23:55,276 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,295 INFO L267 ElimStorePlain]: Start of recursive call 223: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,307 INFO L267 ElimStorePlain]: Start of recursive call 221: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:55,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:23:55,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:23:55,451 INFO L267 ElimStorePlain]: Start of recursive call 230: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 11:23:55,606 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 11:23:55,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:23:55,737 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:55,764 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,779 INFO L267 ElimStorePlain]: Start of recursive call 232: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:55,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:23:55,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:23:55,984 INFO L267 ElimStorePlain]: Start of recursive call 236: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:23:56,139 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:23:56,274 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:23:56,396 INFO L267 ElimStorePlain]: Start of recursive call 239: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-11-23 11:23:56,485 INFO L267 ElimStorePlain]: Start of recursive call 240: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,514 INFO L267 ElimStorePlain]: Start of recursive call 235: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,541 INFO L267 ElimStorePlain]: Start of recursive call 229: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:56,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:23:56,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:56,591 INFO L267 ElimStorePlain]: Start of recursive call 242: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 11:23:56,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:56,629 INFO L267 ElimStorePlain]: Start of recursive call 244: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:56,642 INFO L267 ElimStorePlain]: Start of recursive call 245: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,645 INFO L267 ElimStorePlain]: Start of recursive call 243: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,657 INFO L267 ElimStorePlain]: Start of recursive call 241: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:56,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:56,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:23:56,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:23:56,859 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 11:23:57,029 INFO L267 ElimStorePlain]: Start of recursive call 248: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:57,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 11:23:57,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:57,221 INFO L267 ElimStorePlain]: Start of recursive call 250: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:57,248 INFO L267 ElimStorePlain]: Start of recursive call 251: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,262 INFO L267 ElimStorePlain]: Start of recursive call 249: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-23 11:23:57,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:57,294 INFO L267 ElimStorePlain]: Start of recursive call 253: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:57,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:23:57,327 INFO L267 ElimStorePlain]: Start of recursive call 254: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,349 INFO L267 ElimStorePlain]: Start of recursive call 252: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:57,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-23 11:23:57,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:23:57,525 INFO L267 ElimStorePlain]: Start of recursive call 256: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-23 11:23:57,691 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:23:57,833 INFO L267 ElimStorePlain]: Start of recursive call 258: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:57,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:23:57,962 INFO L267 ElimStorePlain]: Start of recursive call 259: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:58,099 INFO L267 ElimStorePlain]: Start of recursive call 260: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:58,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:23:58,236 INFO L267 ElimStorePlain]: Start of recursive call 261: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:23:58,355 INFO L267 ElimStorePlain]: Start of recursive call 262: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,449 INFO L267 ElimStorePlain]: Start of recursive call 255: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:58,502 INFO L267 ElimStorePlain]: Start of recursive call 246: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,560 INFO L267 ElimStorePlain]: Start of recursive call 219: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:58,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 77 [2018-11-23 11:23:58,864 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-23 11:23:58,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:23:58,874 INFO L267 ElimStorePlain]: Start of recursive call 264: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 11:23:59,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 11:23:59,076 INFO L267 ElimStorePlain]: Start of recursive call 266: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-11-23 11:23:59,219 INFO L267 ElimStorePlain]: Start of recursive call 267: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-23 11:23:59,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2018-11-23 11:23:59,357 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,372 INFO L267 ElimStorePlain]: Start of recursive call 268: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 11:23:59,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:23:59,523 INFO L267 ElimStorePlain]: Start of recursive call 271: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:59,590 INFO L267 ElimStorePlain]: Start of recursive call 272: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,629 INFO L267 ElimStorePlain]: Start of recursive call 270: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:59,665 INFO L267 ElimStorePlain]: Start of recursive call 265: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 11:23:59,800 INFO L478 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 59 treesize of output 58 [2018-11-23 11:23:59,804 INFO L267 ElimStorePlain]: Start of recursive call 274: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,958 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:59,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 11:23:59,962 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,096 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:00,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 49 [2018-11-23 11:24:00,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 11:24:00,198 INFO L267 ElimStorePlain]: Start of recursive call 277: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:00,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:00,684 INFO L267 ElimStorePlain]: Start of recursive call 278: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,816 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:00,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:24:00,818 INFO L267 ElimStorePlain]: Start of recursive call 279: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-11-23 11:24:00,908 INFO L267 ElimStorePlain]: Start of recursive call 280: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,944 INFO L267 ElimStorePlain]: Start of recursive call 276: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,978 INFO L267 ElimStorePlain]: Start of recursive call 273: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:01,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:24:01,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-11-23 11:24:01,209 INFO L267 ElimStorePlain]: Start of recursive call 282: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:01,830 INFO L267 ElimStorePlain]: Start of recursive call 283: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:24:02,375 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:24:02,958 INFO L267 ElimStorePlain]: Start of recursive call 285: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 11:24:03,498 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:03,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:24:03,500 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:24:03,528 INFO L267 ElimStorePlain]: Start of recursive call 288: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,543 INFO L267 ElimStorePlain]: Start of recursive call 286: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 11:24:04,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:04,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 11:24:04,130 INFO L267 ElimStorePlain]: Start of recursive call 290: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,217 INFO L267 ElimStorePlain]: Start of recursive call 289: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 11:24:04,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2018-11-23 11:24:04,612 INFO L267 ElimStorePlain]: Start of recursive call 292: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,650 INFO L267 ElimStorePlain]: Start of recursive call 291: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-23 11:24:04,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 11:24:04,956 INFO L267 ElimStorePlain]: Start of recursive call 294: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,986 INFO L267 ElimStorePlain]: Start of recursive call 293: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,058 INFO L267 ElimStorePlain]: Start of recursive call 281: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:05,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:24:05,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:24:05,260 INFO L267 ElimStorePlain]: Start of recursive call 296: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:24:05,974 INFO L267 ElimStorePlain]: Start of recursive call 297: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:24:06,682 INFO L267 ElimStorePlain]: Start of recursive call 298: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:07,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 50 [2018-11-23 11:24:07,361 INFO L267 ElimStorePlain]: Start of recursive call 299: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:08,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 11:24:08,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:08,154 INFO L267 ElimStorePlain]: Start of recursive call 301: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:08,182 INFO L267 ElimStorePlain]: Start of recursive call 302: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,199 INFO L267 ElimStorePlain]: Start of recursive call 300: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 11:24:08,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:24:08,231 INFO L267 ElimStorePlain]: Start of recursive call 304: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:08,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:08,265 INFO L267 ElimStorePlain]: Start of recursive call 305: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,291 INFO L267 ElimStorePlain]: Start of recursive call 303: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:08,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 11:24:08,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:08,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:24:08,927 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,944 INFO L267 ElimStorePlain]: Start of recursive call 306: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-23 11:24:08,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:08,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2018-11-23 11:24:08,988 INFO L267 ElimStorePlain]: Start of recursive call 309: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:09,035 INFO L267 ElimStorePlain]: Start of recursive call 308: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:09,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 11:24:09,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 11:24:09,492 INFO L267 ElimStorePlain]: Start of recursive call 311: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 11:24:09,581 INFO L267 ElimStorePlain]: Start of recursive call 312: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:09,634 INFO L267 ElimStorePlain]: Start of recursive call 310: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:09,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:09,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 11:24:10,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:10,009 INFO L267 ElimStorePlain]: Start of recursive call 314: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,149 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:10,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:10,163 INFO L267 ElimStorePlain]: Start of recursive call 315: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:10,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:10,329 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:10,487 INFO L267 ElimStorePlain]: Start of recursive call 317: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:10,556 INFO L267 ElimStorePlain]: Start of recursive call 313: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:10,645 INFO L267 ElimStorePlain]: Start of recursive call 295: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,693 INFO L267 ElimStorePlain]: Start of recursive call 263: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:10,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 78 [2018-11-23 11:24:10,900 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-11-23 11:24:10,906 INFO L478 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 9 treesize of output 8 [2018-11-23 11:24:10,907 INFO L267 ElimStorePlain]: Start of recursive call 319: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:11,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:24:11,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:24:11,039 INFO L267 ElimStorePlain]: Start of recursive call 321: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 11:24:11,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:24:11,079 INFO L267 ElimStorePlain]: Start of recursive call 323: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:11,091 INFO L267 ElimStorePlain]: Start of recursive call 324: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,094 INFO L267 ElimStorePlain]: Start of recursive call 322: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,104 INFO L267 ElimStorePlain]: Start of recursive call 320: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:11,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:11,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 55 [2018-11-23 11:24:11,283 INFO L267 ElimStorePlain]: Start of recursive call 326: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:11,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-23 11:24:11,477 INFO L267 ElimStorePlain]: Start of recursive call 327: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:24:11,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:11,720 INFO L267 ElimStorePlain]: Start of recursive call 329: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:11,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:24:11,889 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:12,047 INFO L267 ElimStorePlain]: Start of recursive call 331: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:12,197 INFO L267 ElimStorePlain]: Start of recursive call 332: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:24:12,336 INFO L267 ElimStorePlain]: Start of recursive call 333: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:12,578 INFO L267 ElimStorePlain]: Start of recursive call 328: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:24:12,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 11:24:12,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:12,811 INFO L267 ElimStorePlain]: Start of recursive call 335: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:12,838 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,851 INFO L267 ElimStorePlain]: Start of recursive call 334: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:12,901 INFO L267 ElimStorePlain]: Start of recursive call 325: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:12,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:12,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 11:24:12,988 INFO L478 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 9 treesize of output 8 [2018-11-23 11:24:12,990 INFO L267 ElimStorePlain]: Start of recursive call 338: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:13,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2018-11-23 11:24:13,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 11:24:13,085 INFO L267 ElimStorePlain]: Start of recursive call 340: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-23 11:24:13,160 INFO L267 ElimStorePlain]: Start of recursive call 341: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 11:24:13,216 INFO L267 ElimStorePlain]: Start of recursive call 342: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:24:13,269 INFO L267 ElimStorePlain]: Start of recursive call 343: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 11:24:13,330 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:13,370 INFO L267 ElimStorePlain]: Start of recursive call 339: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:13,409 INFO L267 ElimStorePlain]: Start of recursive call 337: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:13,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:13,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:13,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-23 11:24:13,573 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-23 11:24:13,703 INFO L267 ElimStorePlain]: Start of recursive call 347: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:13,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:24:13,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:13,925 INFO L267 ElimStorePlain]: Start of recursive call 349: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 11:24:14,180 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 4 xjuncts. [2018-11-23 11:24:14,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:24:14,314 INFO L267 ElimStorePlain]: Start of recursive call 351: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:14,418 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:14,502 INFO L267 ElimStorePlain]: Start of recursive call 353: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:24:14,584 INFO L267 ElimStorePlain]: Start of recursive call 354: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,633 INFO L267 ElimStorePlain]: Start of recursive call 348: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:14,766 INFO L267 ElimStorePlain]: Start of recursive call 345: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:14,861 INFO L267 ElimStorePlain]: Start of recursive call 318: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:24:15,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2018-11-23 11:24:15,508 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-23 11:24:15,514 INFO L478 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 9 treesize of output 8 [2018-11-23 11:24:15,515 INFO L267 ElimStorePlain]: Start of recursive call 356: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 11:24:15,690 INFO L478 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 9 treesize of output 8 [2018-11-23 11:24:15,691 INFO L267 ElimStorePlain]: Start of recursive call 358: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2018-11-23 11:24:15,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:15,763 INFO L267 ElimStorePlain]: Start of recursive call 360: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:15,822 INFO L267 ElimStorePlain]: Start of recursive call 361: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:15,894 INFO L267 ElimStorePlain]: Start of recursive call 362: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:24:15,939 INFO L267 ElimStorePlain]: Start of recursive call 363: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:24:15,974 INFO L267 ElimStorePlain]: Start of recursive call 364: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,996 INFO L267 ElimStorePlain]: Start of recursive call 359: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:16,023 INFO L267 ElimStorePlain]: Start of recursive call 357: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:16,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 72 [2018-11-23 11:24:16,483 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-11-23 11:24:16,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:16,492 INFO L267 ElimStorePlain]: Start of recursive call 366: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 11:24:16,621 INFO L267 ElimStorePlain]: Start of recursive call 367: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2018-11-23 11:24:16,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:24:16,782 INFO L267 ElimStorePlain]: Start of recursive call 369: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:16,862 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-23 11:24:16,928 INFO L267 ElimStorePlain]: Start of recursive call 371: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:16,985 INFO L267 ElimStorePlain]: Start of recursive call 372: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:17,039 INFO L267 ElimStorePlain]: Start of recursive call 373: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,079 INFO L267 ElimStorePlain]: Start of recursive call 368: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:17,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-23 11:24:17,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:17,228 INFO L267 ElimStorePlain]: Start of recursive call 375: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:17,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:17,258 INFO L267 ElimStorePlain]: Start of recursive call 376: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,274 INFO L267 ElimStorePlain]: Start of recursive call 374: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,361 INFO L267 ElimStorePlain]: Start of recursive call 365: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:17,426 INFO L267 ElimStorePlain]: Start of recursive call 355: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:17,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2018-11-23 11:24:17,594 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-23 11:24:17,600 INFO L478 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 9 treesize of output 8 [2018-11-23 11:24:17,601 INFO L267 ElimStorePlain]: Start of recursive call 378: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:17,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 86 [2018-11-23 11:24:19,878 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 209 DAG size of output: 184 [2018-11-23 11:24:19,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:19,895 INFO L267 ElimStorePlain]: Start of recursive call 380: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:20,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:24:20,708 INFO L267 ElimStorePlain]: Start of recursive call 381: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:24:21,391 INFO L267 ElimStorePlain]: Start of recursive call 382: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-23 11:24:22,086 INFO L267 ElimStorePlain]: Start of recursive call 383: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-23 11:24:22,746 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:22,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:22,750 INFO L267 ElimStorePlain]: Start of recursive call 385: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,771 INFO L267 ElimStorePlain]: Start of recursive call 384: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2018-11-23 11:24:23,396 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:23,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-11-23 11:24:23,401 INFO L267 ElimStorePlain]: Start of recursive call 387: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 11:24:23,456 INFO L267 ElimStorePlain]: Start of recursive call 388: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,527 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:23,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 11:24:23,592 INFO L267 ElimStorePlain]: Start of recursive call 389: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,815 INFO L267 ElimStorePlain]: Start of recursive call 386: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:24,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-11-23 11:24:24,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 11:24:24,311 INFO L267 ElimStorePlain]: Start of recursive call 391: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,389 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:24,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-11-23 11:24:24,407 INFO L267 ElimStorePlain]: Start of recursive call 392: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,462 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:24,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 11:24:24,467 INFO L267 ElimStorePlain]: Start of recursive call 393: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,509 INFO L267 ElimStorePlain]: Start of recursive call 390: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:25,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2018-11-23 11:24:26,728 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 180 DAG size of output: 104 [2018-11-23 11:24:26,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:26,743 INFO L267 ElimStorePlain]: Start of recursive call 395: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:27,122 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,495 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:27,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:27,502 INFO L267 ElimStorePlain]: Start of recursive call 397: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,737 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:27,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:27,743 INFO L267 ElimStorePlain]: Start of recursive call 398: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:28,038 INFO L267 ElimStorePlain]: Start of recursive call 399: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:24:28,189 INFO L267 ElimStorePlain]: Start of recursive call 400: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,313 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:28,318 INFO L267 ElimStorePlain]: Start of recursive call 401: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,451 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:28,456 INFO L267 ElimStorePlain]: Start of recursive call 402: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,526 INFO L267 ElimStorePlain]: Start of recursive call 394: 10 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:28,720 INFO L267 ElimStorePlain]: Start of recursive call 379: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:28,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2018-11-23 11:24:29,217 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-11-23 11:24:29,227 INFO L478 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 39 treesize of output 38 [2018-11-23 11:24:29,229 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:29,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-11-23 11:24:29,408 INFO L267 ElimStorePlain]: Start of recursive call 405: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:29,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 11:24:29,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 11:24:29,559 INFO L267 ElimStorePlain]: Start of recursive call 407: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:29,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:24:29,608 INFO L267 ElimStorePlain]: Start of recursive call 408: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:29,620 INFO L267 ElimStorePlain]: Start of recursive call 406: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:29,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 51 [2018-11-23 11:24:30,127 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-23 11:24:30,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:30,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:30,143 INFO L267 ElimStorePlain]: Start of recursive call 410: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:30,295 INFO L267 ElimStorePlain]: Start of recursive call 411: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:24:30,422 INFO L267 ElimStorePlain]: Start of recursive call 412: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:30,526 INFO L267 ElimStorePlain]: Start of recursive call 413: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:24:30,635 INFO L267 ElimStorePlain]: Start of recursive call 414: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 11:24:30,727 INFO L267 ElimStorePlain]: Start of recursive call 415: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:30,771 INFO L267 ElimStorePlain]: Start of recursive call 409: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:30,834 INFO L267 ElimStorePlain]: Start of recursive call 403: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:30,896 INFO L267 ElimStorePlain]: Start of recursive call 377: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:31,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 11:24:31,259 INFO L202 ElimStorePlain]: Needed 415 recursive calls to eliminate 10 variables, input treesize:541, output treesize:81 [2018-11-23 11:24:31,294 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:24:31,294 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_sll_create_~new_head~0.base_27, |main_~#s~0.base|, |main_~#s~0.offset|, |#memory_$Pointer$.offset|, v_prenex_11, v_prenex_9, v_prenex_8, v_prenex_7, v_prenex_10]. (and (let ((.cse3 (let ((.cse5 (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)))) (store .cse5 v_sll_create_~new_head~0.base_27 (store (select .cse5 v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~new_head~0.offset)))) (.cse2 (let ((.cse4 (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (store .cse4 v_sll_create_~new_head~0.base_27 (store (select .cse4 v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~new_head~0.base))))) (let ((.cse0 (select (select .cse2 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse1 (select (select .cse3 |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 v_sll_create_~new_head~0.base_27)) (not (= (_ bv0 32) .cse1)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))) (= (select (select .cse2 (select (select .cse2 .cse0) .cse1)) (select (select .cse3 .cse0) .cse1)) (_ bv0 32))))) (let ((.cse8 (let ((.cse11 (store v_prenex_11 sll_create_~new_head~0.base (store (select v_prenex_11 sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (store .cse11 v_prenex_9 (store (select .cse11 v_prenex_9) (_ bv0 32) sll_create_~new_head~0.base)))) (.cse7 (let ((.cse10 (store v_prenex_10 sll_create_~new_head~0.base (store (select v_prenex_10 sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)))) (store .cse10 v_prenex_9 (store (select .cse10 v_prenex_9) (_ bv0 32) sll_create_~new_head~0.offset))))) (let ((.cse6 (select (select .cse7 v_prenex_8) v_prenex_7)) (.cse9 (select (select .cse8 v_prenex_8) v_prenex_7))) (or (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) .cse6)) (= (select (select .cse7 (select (select .cse8 .cse9) .cse6)) (select (select .cse7 .cse9) .cse6)) (_ bv0 32)) (not (= .cse9 v_prenex_9)))))) [2018-11-23 11:24:31,295 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_232, v_prenex_231, v_sll_create_~new_head~0.base_27, v_prenex_9]. (let ((.cse1 (= sll_create_~new_head~0.offset (_ bv0 32))) (.cse2 (= (_ bv0 32) sll_create_~head~0.offset)) (.cse0 (= sll_create_~head~0.base (_ bv0 32)))) (and (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) .cse0 (= v_prenex_232 sll_create_~new_head~0.base)) (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not .cse1) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (= v_prenex_231 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_231) (_ bv0 1))) .cse2) (or .cse1 (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))) .cse0) (or .cse1 (not (= (select |#valid| v_prenex_9) (_ bv0 1))) .cse2) (or (not .cse2) .cse0 (not (= (select |#valid| sll_create_~head~0.base) (_ bv0 1)))))) [2018-11-23 11:24:31,583 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-11-23 11:24:31,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2018-11-23 11:24:31,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {5699#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret20;havoc #t~mem19.base, #t~mem19.offset;havoc #t~ret20; {5699#false} is VALID [2018-11-23 11:24:31,655 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} {5864#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)))} #153#return; {5699#false} is VALID [2018-11-23 11:24:31,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} #res := ~len~0; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {5881#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {5885#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5881#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {5889#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5885#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {5698#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5889#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:31,666 INFO L256 TraceCheckUtils]: 37: Hoare triple {5864#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)))} call #t~ret20 := sll_length(#t~mem19.base, #t~mem19.offset); {5698#true} is VALID [2018-11-23 11:24:31,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {5864#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:24:31,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} assume !(~bvslt32(~i~0, ~k~0) && 0bv32 != #t~nondet16);havoc #t~nondet16; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:31,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:31,670 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5698#true} {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #147#return; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:31,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:31,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:24:31,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:24:31,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:24:31,671 INFO L256 TraceCheckUtils]: 28: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {5698#true} is VALID [2018-11-23 11:24:31,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {5924#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7) |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) |main_#t~ret14.offset|)))))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:31,678 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} {5698#true} #145#return; {5924#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7) |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) |main_#t~ret14.offset|)))))} is VALID [2018-11-23 11:24:31,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} assume true; {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} is VALID [2018-11-23 11:24:31,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} is VALID [2018-11-23 11:24:31,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:31,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:31,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:31,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:33,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} is UNKNOWN [2018-11-23 11:24:33,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} is VALID [2018-11-23 11:24:33,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= sll_create_~head~0.base (_ bv0 32))) (or (forall ((v_prenex_231 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_231) (_ bv0 1))) (= v_prenex_231 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} is VALID [2018-11-23 11:24:33,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= sll_create_~head~0.base (_ bv0 32))) (or (forall ((v_prenex_231 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_231) (_ bv0 1))) (= v_prenex_231 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= sll_create_~head~0.base (_ bv0 32))) (or (forall ((v_prenex_231 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_231) (_ bv0 1))) (= v_prenex_231 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:24:33,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= sll_create_~head~0.base (_ bv0 32))) (or (forall ((v_prenex_231 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_231) (_ bv0 1))) (= v_prenex_231 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:24:33,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:24:33,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {5698#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:24:33,853 INFO L256 TraceCheckUtils]: 12: Hoare triple {5698#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {5698#true} is VALID [2018-11-23 11:24:33,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {5698#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5698#true} {5698#true} #143#return; {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L256 TraceCheckUtils]: 5: Hoare triple {5698#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret22 := main(); {5698#true} is VALID [2018-11-23 11:24:33,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #161#return; {5698#true} is VALID [2018-11-23 11:24:33,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:33,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {5698#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5698#true} is VALID [2018-11-23 11:24:33,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5698#true} is VALID [2018-11-23 11:24:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:24:33,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-11-23 11:24:33,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-11-23 11:24:33,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:33,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:24:36,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 74 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:24:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:24:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=671, Unknown=7, NotChecked=0, Total=756 [2018-11-23 11:24:36,057 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand 28 states. [2018-11-23 11:24:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:48,407 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2018-11-23 11:24:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:24:48,407 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-11-23 11:24:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:24:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 11:24:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:24:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 11:24:48,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2018-11-23 11:24:48,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:48,735 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:24:48,735 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 11:24:48,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=937, Unknown=8, NotChecked=0, Total=1056 [2018-11-23 11:24:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.